Kth Largest Element in a Stream LeetCode solution in C++

1
class KthLargest {
2
 public:
3
  priority_queue<int, vector<int>, greater<int>> pq;
4
  int K;
5

6
  KthLargest(int k, vector<int> &nums) {
7
    K = k;
8
    for (int x : nums) {
9
      pq.push(x);
10
      if (pq.size() > k) {
11
        pq.pop();
12
      }
13
    }
14
  }
15

16
  int add(int val) {
17
    pq.push(val);
18
    if (pq.size() > K) {
19
      pq.pop();
20
    }
21
    return pq.top();
22
  }
23
};