K-th Smallest

Difficulty: 1000 3000 ms 128 MB

sorting

Print the K-th smallest element (duplicates count separately).

Input: the first line has N and K; the second line has N integers.

Output: the K-th smallest value.

Constraints:

• 1 ≤ K ≤ N ≤ 10⁵
• −10⁹ ≤ a_i ≤ 10⁹

Sample Tests

5 2
7 1 5 1 9

1

1 1
4

4

Read the Editorial