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

using namespace std;

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

int N, K;
vector<int> v;

void read() {
    fin >> N >> K;
    for(int i = 1; i <= N; ++i)
    {
        int x;
        fin >> x;
        v.emplace_back(x);
    }
}

void solve() {
    nth_element(v.begin(), v.begin() + K - 1,  v.end());
    fout << v[K - 1];
}
int main() {
    read();
    solve();
    return 0;
}