#include <bits/stdc++.h>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int compare(const void *a, const void *b)
{   int l = *(const int *)a;
    int r = *(const int *)b;
	if (l - r >= 0)
		return 1;
	else
		return -1;

}

int main()
{
	int n,k;
	f >> n;
	f >> k;
	int v[3000002];
	for(int i = 0 ; i <n; i++)
	{
		f >> v[i];
	}
f.close();
	qsort(v, n, sizeof(int), compare);
	g << v[k-1];
g.close();
}