Heap Patterns

1
import java.util.PriorityQueue;
2

3

4
public int[] fn(int[] arr, int k) {
5
    PriorityQueue<Integer> heap = new PriorityQueue<>(CRITERIA);
6

7
    for (int num: arr) {
8
        // TODO: logic to push onto heap according to problem's criteria
9
        heap.add(num);
10

11
        if (heap.size() > k) {
12
            heap.remove();
13
        }
14
    }
15

16
    int[] ans = new int[k];
17

18
    for (int i = 0; i < k; i++) {
19
        ans[i] = heap.remove();
20
    }
21

22
    return ans;
23
}