Leetcode-703 数据流中的第K大元素

class KthLargest:

    def __init__(self, k: int, nums: List[int]):
        self.HEAP = []
        self.size = k
        for num in nums:
            self._push(num)

    def _push(self, num):
        if len(self.HEAP) < self.size:
                heapq.heappush(self.HEAP, num)
        else:
            if self.HEAP[0] < num:
                heapq.heappop(self.HEAP)
                heapq.heappush(self.HEAP, num)

    def add(self, val: int) -> int:
        self._push(val)
        return self.HEAP[0]