Zia the inventory keeper watches over the caldera rim of Firewatch's stores of weights. A careful computation stands between order and chaos. Task: Print the k-th largest element (1-based; duplicates count separately). Input format: First line: n and k. Second line: n integers. Output format: Print the k-th largest value. Constraints: 1 <= k <= n <= 6753; 0 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 6753; 0 <= a[i] <= 1000.
