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

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

const int MAXN = 3000005;
int n;
int v[MAXN];

int main() {

    int k;
    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];

    fout.close();
    return 0;
}