Morning light hits the marble forum of Argentium as Kabir unrolls the day's manifest of shelves. The tally will decide the next shipment. 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 <= 276; 0 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 276; 0 <= a[i] <= 1000000000.
