#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int nmax = 3000000;

int v[nmax + 5], 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] << '\n';
    return 0;
}