#include <stdio.h>
#include <stdlib.h>

#define N 3000000

int v[N];

void part_3(int v[], int st, int dr, int *pp1, int *pp2)
{
    int i = st, p1 = st, p2 = dr - 1;
    while (i <= p2)
    {
        if (v[i] == v[dr])
        {
            i++;
        }
        else if (v[i] < v[dr])
        {
            int aux = v[i];
            v[i++] = v[p1];
            v[p1++] = aux;
        }
        else /// stim ca v[i] > v[dr]
        {
            int aux = v[i];
            v[i] = v[p2];
            v[p2--] = aux;
        }
    }
    int aux = v[dr];
    v[dr] = v[++p2];
    v[p2] = aux;
    *pp1 = p1;
    *pp2 = p2;
}

void quick_sort(int v[], int st, int dr, int k)
{
    if (st >= dr)
    {
        return;
    }
    int p1, p2;
    part_3(v, st, dr, &p1, &p2);
    if (k < p1)
    {
        quick_sort(v, st, p1 - 1, k);
    }
    if (k > p2)
    {
        quick_sort(v, p2 + 1, dr, k);
    }
}

void shuffle_v(int v[], int n)
{
    for (int i = n - 1; i > 0; i--)
    {
        int poz = rand() % (i + 1);
        int aux = v[i];
        v[i] = v[poz];
        v[poz] = aux;
    }
}

int main()
{
    FILE *in, *out;
    in = fopen("sdo.in", "r");
    int n, k;
    fscanf(in, "%d%d", &n, &k);
    for (int i = 0; i < n; i++)
    {
        fscanf(in, "%d", &v[i]);
    }
    fclose(in);
    shuffle_v(v, n);
    k--;
    quick_sort(v, 0, n - 1, k);
    out = fopen("sdo.out", "w");
    fprintf(out, "%d\n", v[k]);
    fclose(out);
    return 0;
}