#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;

#define MAXN 3000001

ifstream f("sdo.in");
ofstream g("sdo.out");

int n, k;
int a[MAXN];

int main()
{
    f >> n >> k;
    for (int i = 1; i <= n; i++) {
        f >> a[i];
    }

    nth_element(a + 1, a + k + 1, a + n + 1);
    g << a[k] << endl;

    return 0;
}