Every season at the sulphur springs of Brimstone, someone must verify the ledger before the auditors arrive. This year the task falls to Urmila, armed only with the crates register. 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 <= 5495; 0 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 5495; 0 <= a[i] <= 1000000.
