题解 | #寻找第K大#

import heapq
#, heappush
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param a int整型一维数组 
# @param n int整型 
# @param K int整型 
# @return int整型
#
class Solution:
    def findKth(self , a: List[int], n: int, K: int) -> int:
        # write code here
        h = []

        for i in a:
            heapq.heappush(h, -i)
            
        for i in range(K-1):
            heapq.heappop(h)

        return -heapq.heappop(h)