#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <climits>
#include <fstream>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
std::vector<int> numbers;
std::ifstream fin("sdo.in");
std::ofstream fout("sdo.out");

int main()
{
    int n,k,x;
    fin >> n >> k;
    numbers.reserve(n);
    for (int i=0;i<n;i++)
    {
        fin >> x;
        numbers.push_back(x);
    }
    std::nth_element(numbers.begin(), numbers.begin()+k-1, numbers.begin()+n);
    fout << numbers[k-1];
    return 0;
}