#include <fstream>
#include <algorithm>
#include <ctime>


int v[3000001];
int n, k;


int quicksort(int l, int r)
{

	int i=l, j=r, pivot = v[(std::rand()%(r-l+1)) + l];
	do 
	{
		while (v[i] < pivot && i <= r)
			++i;
		while (v[j] > pivot && j >= l)
			--j;
		if (i <= j)
		{
			std::swap(v[i], v[j]);
			++i; --j;
		}
	}while(i <= j);


	if (j == k)
		return v[j];
	else if (k < j)
		return quicksort(l, j);
	else
		return quicksort(i, r);

}



int main()
{

	std::srand(std::time(0)); 
	std::ifstream fin("algsort.in");
	std::ofstream fout("algsort.out");

	fin>>n>>k;
	for (int i = 1; i <= n; ++i)
		fin>>v[i];
	fout<<quicksort(1, n);
	fout.close();
	fin.close();
	return 0;

}