'''
Description: 
Autor: Au3C2
Date: 2021-02-11 13:13:12
LastEditors: Au3C2
LastEditTime: 2021-02-11 13:13:39
'''
class KthLargest:

    def __init__(self, k: int, nums: List[int]):
        self.heap = []
        self.k = k
        for num in nums:
            heapq.heappush(self.heap,num)
            if len(self.heap) > k:
                heapq.heappop(self.heap)


    def add(self, val: int) -> int:
        heapq.heappush(self.heap,val)
        if len(self.heap) > self.k:
            heapq.heappop(self.heap)
        return self.heap[0]

# 堆，简单，每日一题。不太想做
# https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/