include [HTML_REMOVED]
include [HTML_REMOVED]
void quick_sort(int q[],int l,int r){
if(l>=r) return;
int x = q[(l+r)/2], i = l, j = r;
while(i<=j){
while(q[i][HTML_REMOVED]x){
j–;
}
if(i<=j){
int temp = q[i];
q[i] = q[j];
q[j] = temp;
i++;
j–;
}
}
quick_sort(q,l,j);
quick_sort(q,i,r);
}
int main(){
int n,m;
scanf(“%d %d”,&n,&m);
int q = (int)malloc(n*sizeof(int));
for(int i=0;i<n;i++){
scanf(“%d “,&q[i]);
}
quick_sort(q,0,n-1);
printf(“%d”,q[m-1]);
return 0;
}