leetcode

0 class KthLargest {

1 priority_queue<int, vector<int>, greater<int>> pq;

2 int k;

3

4 public:

5 KthLargest(int k, vector<int> &nums) : k(k), pq(nums.begin(), nums.end()) {

6 while (pq.size() > k)

7 pq.pop();

8 }

9

10 int add(int val) {

11 pq.push(val);

12 if (pq.size() > k) pq.pop();

13 return pq.top();

14 }

15 };