# include<bits/stdc++.h>
using namespace std;
int n,k;
priority_queue<int>a;
inline void read(int &x)
{
	char ch=getchar();x=0;
	for(;ch<'0'||ch>'9';ch=getchar());
	for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
}
int main()
{
	int l;
    read(n),read(k);
    for(int i=1;i<=n;i++)
    {
    	read(l);
    	if(i<=k+1)
    	{
    		a.push(l);
		}
		else if(a.top()>l)
		{
			a.pop();
			a.push(l);
		}
	}
	printf("%d",a.top());
}