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