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

Question

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:

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.

Accepted Answer

Find the Kth largest element in an array of distinct positive integers.

Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.

Accepted Answer

if we think about this question, then the first approach that comes into our mind should sort the array and then pick the kth element from last, but its time complexity would be high, can optimize it by using heap, specifically min heap.

1 .create a min heap of size k size then iterate over the array and put the element into the heap .

2.the top element of min heap would we our final answer.