K Largest Elements Problem Statement

You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.

Input:

The first line contains an integer 'T' which represents the number of test cases.
Each test case begins with a line containing two space-separated positive integers 'N' and 'K', where 'N' is the number of elements in the array and 'K' is the number of largest elements you need to return.
The following line contains 'N' space-separated integers representing the elements of the array.

Output:

For each test case, output 'K' largest elements from the array in non-decreasing order on a new line.

Example:

Input:

2
5 3
1 2 3 4 5
7 2
3 -2 7 1 5 0 6

Output:

3 4 5
6 7

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 10⁴
• 1 ≤ K ≤ N
• -10⁹ ≤ ARR[i] ≤ 10⁹

Note:

You do not need to print anything; simply implement the function to return the result.

Follow Up:

Consider if you can solve this in less than O(N*log(N)) time complexity?