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

using namespace std;

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

int n, k;
vector < long long > v;
int main()
{
    fin >> n >> k;

    v.resize(n + 1);

    for(int i = 0; i < n; i++)
        fin >> v[i];

    nth_element(v.begin(), v.begin() + k, v.end());

    fout << v[k];

    fin.close();
    fout.close();
    return 0;
}