#include <algorithm>
#include <fstream>

using namespace std;

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

const int MAX_N = 3000100;

int N, K;
int v[MAX_N];

int main()
{
    fin >> N >> K;

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

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

    fout << v[K] << "\n";

    return 0;
}