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

int n,k;

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

int main(){
    int x,i;
    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);
        scanf("%d %d",&n,&k);
        for(int i=1;i<=n;i++){
            scanf("%d",&x);
            h.push_back(x);
            push_heap(h.begin(),h.end(),cmp); }
        i=1;
        while(i<k){
            x=h[0];
            while(h.size()>0&&h[0]==x){
                pop_heap(h.begin(),h.end(),cmp);
                h.pop_back(); }
            i++; }
        printf("%d\n",h[0]);
}