#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int>h;

int v[3000001];
int a[50],b[50],c[50];
int n,k;

bool cmp(int a,int b){ return a>b; }

int main(){
    int x;
    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);
        scanf("%d %d",&n,&k);
        for(int i=1;i<=n;i++)scanf("%d",&v[i]);
        sort(v+1,v+500001);
        /*{
            scanf("%d",&x);
            h.push_back(x);
            push_heap(h.begin(),h.end(),cmp); }
        for(int i=1;i<k;i++){
                pop_heap(h.begin(),h.end(),cmp);
                h.pop_back();}
        printf("%d\n",h[0]);
   // merge(a,b+1,b+5,c+3,c+9); */
   printf("%d\n",v[k]);
}