844. Time Complexity: Heap Top K

function topK(nums, k) {
  const heap = new MinHeap()

  for (const num of nums) {
    heap.push(num)
    if (heap.size() > k) heap.pop()
  }

  return heap.toArray()
}