include[HTML_REMOVED]
using namespace std;
const int N = 1000010;
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[HTML_REMOVED]x);
if(i[HTML_REMOVED]>n;
cin>>k;
for(int i = 0;i[HTML_REMOVED]>q[i];
}
quick_sort(q,0,n-1);
cout<<q[k-1];
}