kth-largest-element-in-a-stream.cpp

class KthLargest {
    priority_queue<int, vector<int>, greater<int>> pq;// minheap
    int k;
public:
    KthLargest(int k, vector<int>& nums) {
        this->k = k;
        for(auto x: nums){
            this->add(x);           
        }
    }
    
    int add(int val) {
        pq.push(val);
        
        if(pq.size() > k)
            pq.pop();
        
        return pq.top();
    }
};

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