include[HTML_REMOVED]

using namespace std;
const int N = 100010;

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>>1];
while(i<j){
    do{i++;
    }while(q[i]<x);

    do{
        j--;
    }while(q[j]>x);

    if(i<j) swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);

}
int main(){
int n; int k;
int a[N];
scanf(“%d”,&n);
scanf(“%d”,&k);

for(int i=0;i<n;i++){
    scanf("%d",&a[i]);
}
quick_sort(a,0,n-1);
printf("%d",a[k-1]);
return 0;

}