数组中的第K个最大元素

import heapq
def solve():
    def findKthLargest(____):
        heap = []
        for num in nums:
            heapq.heappush(____)
            if len(____) > k:
                heapq.heappop(____)
        return heap[____]
    print(findKthLargest(____))