#include<fstream>
#include<queue>
#include<algorithm>
using namespace std;
priority_queue<int, vector<int>, greater<int> > Q;
int main(){
	unsigned int n, k, i, x;
	ifstream f("sdo.in");
	f>>n>>k;
	for(i=1;i<=n;i++){
		f>>x;
		Q.push(x);
	}
	f.close();
	while(--k)
		Q.pop();
	ofstream g("sdo.out");
	g<<Q.top()<<'\n';
	g.close();
	return 0;
}