#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");

const int NMAX = 3000001;

int v[NMAX], n, k;

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