#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
using namespace std;
vector <int> a;
int n, k;
void read()
{
    ifstream f("sdo.in");
    f >> n >> k;
    for(int i=0, x; i<n; ++i)
    {
        f >> x;
        a.push_back(x);
    }
    f.close();
}

void solve()
{
    ofstream g("sdo.out");
    nth_element(a.begin(),a.begin()+k, a.end());
    g << a[k-1] << '\n';
    g.close();
}

int main()
{
    read();
    solve();
    return 0;
}