#include<cstdio>
#include<algorithm>
using namespace std;
int m,n,i,a[3000010];
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("sdo.in","r",stdin);
	freopen("sdo.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)scanf("%d",&a[i]);
}
void solve()
{
	partial_sort(a+1,a+m+1,a+n+1);
	printf("%d\n",a[m]);
}