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

using namespace std;

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

int n, k, v[3000001];

int main()
{
    fin >> n >> k;
    for (int i=1; i<=n; i++)
        fin >> v[i];
    sort(v+1, v+n+1);
    fout << v[k];
    return 0;
}