Deep in the salt flats of Palemere, Dev studies rows of weights entries. One clean number will settle the guild's oldest argument. 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 <= 272; 0 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 272; 0 <= a[i] <= 1000000000.
