[Leetcode] Medium : Kth Largest in an Array

Description

Given an integer array nums and an integer k, return the kth largest element in the array.

Note that it is the kth largest element in the sorted order, not the kth distinct element.

 

Example 1:

Input: nums = [3,2,1,5,6,4], k = 2
Output: 5

Example 2:

Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
Output: 4

 

My Solution

class Solution:
    def findKthLargest(self, nums: List[int], k: int) -> int:
        import heapq
        
        h = []
        
        for val in nums:
            heapq.heappush(h, -val)
        
        for i in range(k):
            answer = heapq.heappop(h)
        
        return -answer