#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
#define MAXN 3000000

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];
    }

    sort (a + 1, a + n + 1);

    g << a[k] << '\n';

    f.close();
    g.close();
    return 0;
}