#include<stdio.h>
#include<algorithm>
#include<ctime>
#define MAXX 300005
using namespace std;

int v[MAXX], n, k;


void read()
{
    int i;

    scanf("%d%d", &n, &k);

    for(i = 1; i <= n; i++)
        scanf("%d", &v[i]);
}



int partitionpos(int low, int high)
{
    int i, j, pivot;

    pivot = v[low + rand() % (high - low + 1)];
    i = low - 1;
    j = high + 1;

     while (i <= j)
    {
        i++;
        j--;

        while (v[i] < pivot)
            i++;

        while (v[j] > pivot)
            j--;

        if (i < j)
            swap(v[i], v[j]);
         else
            return j;
    }
}



void quicksort(int low, int high)
{
    int pivot;

    if(low == high)
        return;

        pivot = partitionpos(low, high);

        if(k <= pivot)
            quicksort(low, pivot);
        else
            if(k > pivot)
                quicksort(pivot + 1, high);
}



void afis()
{
    int i;

    for(i = 1; i <= n; i++)
        printf("%d ", v[i]);
}


int main()
{
    freopen("sdo.in", "r", stdin);
    freopen("sdo.out", "w", stdout);

    srand(time(0));

    read();

    quicksort(1, n);

    //afis();
    printf("%d", v[k]);

    fclose(stdin);
    fclose(stdout);
    return 0;

}