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

using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");

#define ll long long
#define pb push_back
const int NMax = 3e6 + 5;

int N,K;
int v[NMax];

int main() {
    in>>N>>K;
    for (int i=1;i <= N;++i) {
        in>>v[i];
    }

    sort(v+1,v+N+1);

    out<<v[K]<<'\n';

    in.close();out.close();
    return 0;
}