It is audit day at the ribbon falls of Cascade Vale. Porter spreads the crates records across the table and picks up a sharp pencil. 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 <= 373; -1000000 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 373; -1000000 <= a[i] <= 1000000000.
