【CODE】Kth Largest Element in a Stream

703. Kth Largest Element in a Stream

Easy

452217FavoriteShare

Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Your KthLargest class will have a constructor which accepts an integer k and an integer array nums, which contains initial elements from the stream. For each call to the method KthLargest.add, return the element representing the kth largest element in the stream.

Example:

int k = 3;
int[] arr = [4,5,8,2];
KthLargest kthLargest = new KthLargest(3, arr);
kthLargest.add(3);   // returns 4
kthLargest.add(5);   // returns 5
kthLargest.add(10);  // returns 5
kthLargest.add(9);   // returns 8
kthLargest.add(4);   // returns 8

Note:
You may assume that nums' length ≥ k-1 and k ≥ 1.

class KthLargest {
public:
    priority_queue<int,vector<int>,greater<int> > q;
    int size=0;
    KthLargest(int k, vector<int>& nums) {
        size=k;
        for(int i=0;i<nums.size();i++){
            q.push(nums[i]);
            if(q.size()>k) q.pop();
        }
    }
    
    int add(int val) {
        q.push(val);
        if(q.size()>size) q.pop();
        return q.top();
    }
};

/**
 * Your KthLargest object will be instantiated and called as such:
 * KthLargest* obj = new KthLargest(k, nums);
 * int param_1 = obj->add(val);
 */

• Runtime: 56 ms, faster than 29.91% of C++ online submissions for Kth Largest Element in a Stream.
• Memory Usage: 19.4 MB, less than 75.00% of C++ online submissions for Kth Largest Element in a Stream.
• Next challenges:
• Super Ugly Number
• Reorganize String
• K Closest Points to Origin
• 关于priority_queue：
• https://www.cnblogs.com/huashanqingzhu/p/11040390.html
• 在优先队列中，元素被赋予优先级，当访问元素时，具有最高优先级的元素最先删除，