#include<fstream>
#include<queue>
#include<algorithm>
using namespace std;
#define MAXN 3000009
int a[MAXN];
int main(){
	unsigned int n, k, i;
	ifstream f("sdo.in");
	f>>n>>k;
	for(i=1;i<=n;i++)
		f>>a[i];
	make_heap(a+1, a+n+1, greater<int>());
	f.close();
	while(--k){
		pop_heap(a+1, a+n+1, greater<int>());
		n--;
	}
	ofstream g("sdo.out");
	g<<a[1]<<'\n';
	g.close();
	return 0;
}