from heapq import *

class Solution:
  def findKLargestNumbers(self, nums, k):
    # O(n)
    heap = [-n for n in nums]
    heapify(heap)

    # O(k log n)
    return [
      -heappop(heap) for _ in range(k)
    ]