#include <fstream>
#include <queue>

using namespace std;

#define MAX_N 3000005

ifstream fin ("sdo.in");
ofstream fout ("sdo.out");

priority_queue <int> Q;
int N, K;

int main()
{
	fin >> N >> K;
	for(int i = 1; i <= K; ++i)
	{
		int x;
		fin >> x;
		Q.push(x);
	}

	for(int i = K+1; i <= N; ++i)
	{
		int x;
		fin >> x;
		if(x < Q.top())
		{
			Q.pop();
			Q.push(x);
		}
	}

	fout << Q.top();
}