Kth Largest Element in a Stream.py

# Runtime: 143 ms (Top 61.21%) | Memory: 18.3 MB (Top 46.75%)
class KthLargest:
    def __init__(self, k: int, nums: List[int]):
        self.k = k
        self.hp = []
        for x in nums:
            self.add(x)

        return None

    def add(self, val: int) -> int:
        heapq.heappush(self.hp, (val))
        if len(self.hp) > self.k:
            heapq.heappop(self.hp)

        return self.get_kth_largest()

    def get_kth_largest(self):
        return self.hp[0]