Time Cost

8min2s

Implementation

Use min heap to save k-th largest element

Code

• Solution

  class Solution {
  public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int, vector<int>, greater<int>> minheap;
  
        for (int num: nums) {
            if (minheap.size() < k) {
                minheap.emplace(num);
            }else{
                if (num > minheap.top()) {
                    minheap.pop();
                    minheap.emplace(num);
                }
            }
        }
        return minheap.top();
    }
  };