n,k=map(int,input().split(' '))
arr=[int(x) for x in input().split(' ')]
arr.sort()
arr.reverse()
print(arr[k-1])
/*
########################################################
# #
# Mahfuza Nasrin Khan #
# Leading University,Sylhet #
# Department Of Computer Science and Engineering #
# Code written in : 2023-12-08-22.14 #
# #
########################################################
*/
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cerr << (#x) << " is " << (x) << endl
int main()
{
int n,k;
cin>>n>>k;
int arr[n];
for (int i=0; i<n; i++)
{
cin>>arr[i];
}
sort(arr, arr + n, greater<int>());
cout<<arr[k-1]<<endl;
return 0;
}
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |