#include <cstdio>
#include <algorithm>

#define nMax 3000005
using namespace std;
int n, k;
int v[nMax];

void read()
{
    scanf("%d%d", &n, &k);

    for(int i=1;i<=n;i++)
        scanf("%d", &v[i]);
}
void qsort(int st, int dr, int k)
{
    if(st==dr)
        return;
    int x=v[st+rand()%(dr-st+1)], i=st, j=dr;
    while(i<j)
    {
        for(;v[i]<=x;i++);
        for(;v[j]>x;j--);
        if(i<j)
            swap(v[i], v[j]);
    }
    if(k<=j-st+1)
        qsort(st, j, k);
    else
        qsort(j+1, dr, k-(j-st+1));
}
void write()
{
    printf("%d", v[k]);
}
int main()
{
    freopen("sdo.in", "r", stdin);
    freopen("sdo.out", "w", stdout);

    read();
    qsort(1, n, k);
    write();
    return 0;
}