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

using namespace std;

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

const int NMax = 3000005;
int v[NMax];

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