#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

const int MAXN = 3000011;

int v[MAXN], N, K;

int main ()
{
    fin >> N >> K;
    for (int i = 1; i <= N; ++i)
        fin >> v[i];

    nth_element(v+1, v+K, v+N+1);

    fout << v[K];

    fin.close();
    fout.close();

    return 0;
}