#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <cstring>
#include <climits>

#define NMAX 2000003
using namespace std;

//solutie cu STL

int n,k;
vector<int>v;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

int main()
{
	fin >> n>>k;
	for (int i = 1; i <= n; i++)
	{
		int x;
		fin >> x;
		v.push_back(x);
	}
	auto m = v.begin() + k-1;
	//metoda astta are la baza un quicksort in care pivotul e alse mai special
	std::nth_element(v.begin(), m, v.end());
	fout << v[k - 1];
	return 0;
}