Caravans arrive at the fox den of Rustwood with crates of ledgers, and Gardener the accountant must account for every last one. Task: Print the k-th smallest element (1-based; duplicates count separately). Input format: First line: n and k. Second line: n integers. Output format: Print the k-th smallest value. Constraints: 1 <= k <= n <= 432; -1000000000 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 432; -1000000000 <= a[i] <= 1000000.
