class Solution:
def findKthLargest(self, nums: List[int], k: int) -> int:
heap = []
for num in nums:
heapq.heappush(heap, (-num))
res = nums[-1]
for i in range(k):
res = heapq.heappop(heap)
return -res