Every season at the shipyard of Keelwind, someone must plan the festival budget. This year the task falls to Tina, armed only with the ledgers 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 <= 697; -1000000 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 697; -1000000 <= a[i] <= 1000000000.
