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