#include <iostream>
#include <fstream>

#define maxN 3000003

using namespace std;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

int n,k,v[maxN];

int pivot(int left, int right)
{
    int i=left, j=right, x=v[left];

    while (i<j)
    {
        while (i<j && v[j]>x) --j;
        v[i]=v[j];
        while (i<j && v[i]<=x) ++i;
        v[j]=v[i];
    }

    v[i]=x;
    return i;
}


void quickSelect(int left, int right, int k)
{
    if (left==right) return;

    int x=pivot(left,right);
    int nr=x-left+1;

    if (nr>=k) quickSelect(left,x,k);
    else quickSelect(x+1,right,k-nr);
}

int main()
{
    fin>>n>>k;
    for (int i=1; i<=n; ++i)
        fin>>v[i];
    quickSelect(1,n,k);
    fout<<v[k];
    return 0;
}