include[HTML_REMOVED]
using namespace std;
const int N=100000000;
int q[N];
int n,k;
void quick_sort(int a[],int l,int r)
{
if(l>=r)return;
int x=a[l],i=l-1,j=r+1;
while(i[HTML_REMOVED]x);
if(i<j)swap(a[i],a[j]);
}
quick_sort(a,l,j);
quick_sort(a,j+1,r);
}
int main()
{
scanf(“%d%d”,&n,&k);
int i=0;
int j=n;
while(n–)
{
scanf(“%d”,&q[i]);
i++;
}
quick_sort(q,0,j-1);
printf(“%d”,q[k-1]);
return 0;
}