#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N=1e6+10;

typedef long long ll;

int n;
ll q[N]={0};

void quick_sort(ll q[],int l,int r){
    if(l>=r) return ;

    ll x = q[l+r >> 1];

    int i=l-1,j=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 k;
    scanf("%d %d",&n,&k);
    for(int i=0;i<n;i++) scanf("%lld",&q[i]);

    quick_sort(q,0,n-1);

    printf("%d",q[k-1]);
}