In the spice bazaar of Saffronia, Forester the ledger master keeps careful count of the shelves. assign crews to the morning shifts, every figure matters. 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 <= 711; 0 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 711; 0 <= a[i] <= 1000.
