#include <bits/stdc++.h>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n,i,k,v[3000005];
void quickSort(int,int);
int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)fin>>v[i];
    quickSort(1,n);
    fout<<v[k];
    return 0;
}
void quickSort(int Lo,int Hi)
{
    if(Lo>=Hi)return;
    int lo=Lo,hi=Hi,mi,pivot;
    mi=lo+rand()%(hi-lo+1);
    pivot = v[mi];
    do
    {
        while(v[lo]<pivot)lo++;
        while(v[hi]>pivot)hi--;
        if(lo<=hi){swap(v[lo],v[hi]);lo++;hi--;}
    }
    while(lo<=hi);
    if(k<=hi)quickSort(Lo,hi);
    else quickSort(lo,Hi);
}