Find Top K Frequent Numbers in a Stream

Given an integer array ARR and an integer K, your task is to find the K most frequent elements in ARR. Return the elements sorted in ascending order.

Example:

Input:

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

Output:

[2, 3]

Explanation:

2 and 3 are the elements occurring the most number of times.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 5000
• 1 <= K <= Number of unique elements in ARR
• 1 <= ARR[i] <= 106
• Time Limit: 1 sec