/*#include <cstdio>
#include <queue>

using namespace std;

FILE *fin = fopen("sdo.in","r");
FILE *fout = fopen("sdo.out","w");

priority_queue <int> MyQue;
int N, K, x;

int main() {
    fscanf(fin, "%d %d\n", &N, &K);

    for(int i = 1; i <= N; ++i) {
        fscanf(fin, "%d", &x);

        MyQue.push(x);
    }

    while(N >= K) {
        ++K;
        x = MyQue.top();
        //cout << x << '\n';
        MyQue.pop();
    }

    fprintf(fout, "%d\n", x);

    fclose(fin);
    fclose(fout);

    return 0;
}
*/

#include <cstdio>
#include <algorithm>

using namespace std;

#define DIM 3000002

FILE *fin = fopen("sdo.in","r");
FILE *fout = fopen("sdo.out","w");

int N, K, V[DIM];

int main() {
    fscanf(fin, "%d %d\n", &N, &K);

    for(int i = 1; i <= N; ++i) {
        fscanf(fin, "%d", &V[i]);
    }

    nth_element(V + 1, V + K, V + 1 + N);

    fprintf(fout, "%d\n", V[K]);

    fclose(fin);
    fclose(fout);

    return 0;
}