Deep in the mountain city of Highreach, Envoy studies rows of registers entries. One clean number will settle the guild's oldest argument. 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 <= 5779; 0 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 5779; 0 <= a[i] <= 1000000.
