#include<cstdio>
//#include<ctime>
//#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
int v[3000005];
/*int part(int st, int dr)
{
	int poz,i;
	poz=st+rand()%(dr-st+1);
	swap(v[dr],v[poz]);
	for(i=poz=st;i<dr;i++)
		if(v[i]<v[dr])
			swap(v[i],v[poz+i]);
	swap(v[dr],v[poz]);
	return poz;
}
int bin(int st, int dr, int k)
{
	int pp=part(st,dr);
	while(pp!=k)
	{
		if(pp<k)
			st=pp+1;
		else dr=pp-1;
		pp=part(st,dr);
	}
	return v[k];
}*/
/*
Minato: You're overanalyzing, Aigis.
Aigis: :(
*/
int main()
{
	int n,k;
	//srand(time(NULL));
	freopen("sdo.in","r",stdin);
	freopen("sdo.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
		scanf("%d",&v[i]);
	nth_element(v+1,v+k,v+n+1);
	printf("%d\n",v[k]);
	return 0;
}