Kth Largest Element Problem

Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

Example:

Input:

N = 6, K = 3, array = [2, 1, 5, 6, 3, 8]

Output:

5

Explanation:

Sorting the array in non-increasing order gives [8, 6, 5, 3, 2, 1]. The 3rd largest element is 5.

Constraints:

• 1 <= T <= 100
• 1 <= N <= 10^4
• 1 <= ARR[i] <= 10^9
• 1 <= K <= N

Note:

Kth largest element in an array is the kth element when sorted in descending order. All elements are distinct.

Input:

The first line contains an integer 'T' representing the number of test cases. Each test case consists of two lines. The first line contains integers 'N' and 'K'. The second line contains 'N' space-separated integers of the array.

Output:

Print the Kth largest element for each test case.