K Most Frequent Elements Problem Statement

Given an integer array ARR and an integer K, identify the K most frequent elements within ARR. Return these elements sorted in ascending order.

Example:

Input:

ARR = [1, 2, 2, 3, 3], K = 2

Output:

[2, 3]

Explanation:

The elements 2 and 3 appear most frequently in the array.

Constraints:

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 5000
• 1 ≤ K ≤ Number of unique elements in ARR
• 1 ≤ ARR[i] ≤ 106

Input Format:

The first line comprises a single integer 'T', indicating the number of test cases. For each test case, the first line presents two space-separated integers, ‘N’ and ‘K’. The second line provides ‘N’ space-separated integers representing the elements of ‘ARR’.

Output Format:

Output the ‘K’ most frequently occurring elements, each line corresponding to a test case.

Note:

A unique solution for each test case is guaranteed. Directly implementing the function is required, as output handling is preset.