class Solution:
    def findKthLargest(self, nums: List[int], k: int) -> int:
        #堆栈 时间复杂度O(n)
        import heapq
        res = []
        for num in nums:
            heapq.heappush(res, -num)
        for i in range(k):
            temp = heapq.heappop(res)
        return -temp