#include <iostream>
#include<fstream>
#include<cstdlib>
#include<ctime>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
long long v[3000005], x;
int n, k, p;

long long poz(int begin, int end){
while ( begin <= end ) {
        while ( v[begin] < v[p] )
            ++begin;
        while ( v[end] > v[p] )
            --end;

        if ( begin <= end ) {
            swap( v[begin], v[end] );
            ++begin;
            --end;
        }
    }

return end;
}


void sdo( int left, int right ) {
    if ( left >= right )
        return;

    int piv = v[left + rand() % ( right - left + 1 )], begin = left, end = right;

    while ( begin <= end ) {
        while ( v[begin] < piv )
            ++begin;
        while ( v[end] > piv )
            --end;

        if ( begin <= end ) {
            swap( v[begin], v[end] );
            ++begin;
            --end;
        }
    }

    if ( k <= end )
        sdo( left, end );
    else
        sdo( begin, right );
}


int main()
{
    f>>n>>k;
    for(int i=1; i<=n; ++i){
       f>>v[i];
    }
    sdo(1, n);
    g<<v[k]<<'\n'; cout<<v[k];
    g.close();
    return 0;
}