class Solution:
def getLeastNumbers(self, arr: List[int], k: int) -> List[int]:
#return heapq.nsmallest(k, arr)
if k == 0:
return []
hp = [-i for i in arr[:k]]
heapq.heapify(hp)
for i in arr[k:]:
if -i > hp[0]:
heapq.heappop(hp)
heapq.heappush(hp, -i)
res = [-i for i in hp]
return res