703_KthLargestElementinaStream - a920604a/leetcode GitHub Wiki

class KthLargest {
private:
    priority_queue<int, vector<int>, greater<int>> pq;
    int size ;
public:
    KthLargest(int k, vector<int>& nums) {
        size = k;
        for(int n:nums){
            pq.push(n);
            if(pq.size() > size) pq.pop();
        }
    }
    int add(int val) {
        pq.push(val);
        if(pq.size() > size) pq.pop();
        return pq.top();
    }
};