#include <iostream>
#include <fstream>

using namespace std;

int a[3000005], N, K;

int poz( int left, int right )
{
    int m = -1;

    while( left < right )
    {
        if ( a[left] > a[right] )
        {
            swap( a[left], a[right] );
            m = -m;
        }

        if ( m == 1 )
            left++;
        else
            right--;
    }

    return left;
}

void sort(  int left, int right, int k )
{
    if ( left < right )
    {
        int q = poz( left, right );
        int t = q - left + 1;

        if( t >= k )
            sort ( left, q, k );
        else
            sort( q + 1, right, k - t );
    }
}

int main()
{
    ifstream f("sdo.in");
    ofstream g("sdo.out");

    f >> N >> K;

    for ( int i = 1; i <= N; i++ )
        f >> a[i];

    sort(1, N,K);

    g << a[K];

    return 0;
}