Kth Smallest Element in an Unsorted Array

Given an unsorted array arr of distinct integers and an integer k, your task is to find the k-th smallest element in the array.

Input:

The first line of input contains an integer T denoting the number of test cases.
The first line of each test case contains two space-separated integers, n and k, where n is the array's size.
The second line of each test case contains n space-separated integers denoting the array elements.

Output:

For each test case, return the k-th smallest element in the array.
Output for each query is printed in a separate line.

Example:

Input:
n = 5, k = 2 and arr[] = {6, 5, 4, 8, 7}
Output:
The array elements in sorted order are [4, 5, 6, 7, 8]. The ‘2-nd’ smallest element in the array is 5, so the answer is 5.

Constraints:

• 1 <= T <= 10
• 1 <= n <= 1000
• 1 <= k <= n
• -10^6 <= arr[i] <= 10^6

Note:

1. Don’t print anything. Return the value of k-th smallest element.
2. k is a positive integer and not greater than the size of the array.
3. The array arr is unsorted, and all the elements of the array are distinct.