#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <algorithm>

using namespace std;

ifstream fin("sdo.in");
ofstream fout("sdo.out");

int n, k, v[500001];

int quick_sort(int st, int dr){
    int i = st, j = dr, aux;
    int pivot = v[rand() % (dr - st + 1) + st];
    do{
        while(v[i] < pivot && i <= dr){
            i++;
        }
        while(v[j] > pivot && j >= st){
            j--;
        }
        if(i <= j){
            aux = v[i];
            v[i] = v[j];
            v[j] = aux;
            i++;
            j--;
        }

    }while(i <= j);

    if(j == k) return v[j];
    else if(j > k) return quick_sort(st, j);
    else return quick_sort(i, dr);
}
int main()
{
    int i, x;
    fin>>n>>k;
    for(i = 1; i <= n; ++i){
        fin>>v[i];
    }
    x = quick_sort(1, n);
    fout<<x;
    return 0;
}