#include <iostream>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
using namespace std;

int main() {
  freopen("sdo.in","r",stdin);
  freopen("sdo.out","w",stdout);
  int n, k;
  scanf("%d %d", &n, &k);
  vector<int> nums(n);
  for (int i = 0  ; i < n; ++i) {
    scanf("%d", &nums[i]);
  }
  nth_element(nums.begin(), nums.begin() + k - 1, nums.end());
  cout << nums[k-1];

  return 0;
}