#include<bits/stdc++.h>
using namespace std;
void quicksort(int r[],int left,int right){
    if(right<=left)
        return;
    int i = left, j = right;
    int x = r[i];
    while(i<j){
        while((r[j]>=x)&&(j>i))
            j = j - 1;
        r[i] = r[j];
        while((r[i]<=x)&&(j>i))
            i = i + 1;
        r[j] = r[i];
    }
    r[i] = x;
    quicksort(r, left, i - 1);
    quicksort(r, i + 1, right);
}
int main(){
    int n,m,ar[5000005];
    scanf("%d%d", &n, &m);
    for (int j = 1; j <= n;j++)
        scanf("%d", &ar[j]);
    quicksort(ar, 1, n);
    printf("%d",ar[m]);
    return 0;
}