#include <bits/stdc++.h>

using namespace std;

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

const int N = 4000005;

int totalNumbers, searchedPosition,
    numbers[N];

int main(){
    fin >> totalNumbers >> searchedPosition;
    for ( int index = 0 ; index < totalNumbers; index++ ){
        fin >> numbers[index];
    }
    nth_element(numbers, numbers+searchedPosition-1, numbers+totalNumbers);
    fout << numbers[searchedPosition-1];
    return 0;
}