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

void QuickSort(vector<int> &a, int l, int r, int k) {
  int i = l, j = r, piv = a[(l+r)/2];
  while (i < j) {
    while (a[i] < piv) i++;
    while (a[j] > piv) j--;
    if (i <= j) {
	    swap(a[i++], a[j--]);
    }
  }
  if (i < r && i <= k) QuickSort(a, i, r, k);
  if (j > l && k <= j)  QuickSort(a, l, j, k);
}

int main() {
  freopen("sdo.in","r",stdin);
  freopen("sdo.out","w",stdout);
  int n, x, k;
  vector<int> nums;
  cin >> n >> k;
  for (int i = 0  ; i < n; ++i) {
    cin >> x;
    nums.push_back(x);
  }
  QuickSort(nums, 0, nums.size() - 1, k);
  cout << nums[k-1];

  return 0;
}