#include <fstream>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");

int n, k, v[3000001];

void qsort(int v[], int st, int dr)
 {
    int i = st, j = dr;
    int tmp;
    int pivot = v[(st + dr) / 2];

    while (i <= j) {
        while (v[i] < pivot)
            i++;
        while (v[j] > pivot)
            j--;
        if (i <= j) {
            tmp = v[i];
            v[i] = v[j];
            v[j] = tmp;
            i++;
            j--;
        }
    }

    if (st < j)
        qsort(v, st, j);
    if (i < dr)
        qsort(v, i, dr);
}

int main()
{
    in >> n >> k;
    for (int i=1; i<=n; i++)
        in >> v[i];
    qsort(v,1,n);

    out << v[k];

    return 0;
}