leetcode

0 class Solution {

1 public:

2 int findKthLargest(vector<int> &nums, int k) {

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

4

5 for (int num : nums) {

6 pq.push(num);

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

8 }

9

10 return pq.top();

11 }

12 };