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