215. 数组中的第K个最大元素

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int, std::vector<int>, std::greater<int>> q;
        for(int i=0; i<nums.size(); ++i)
        {
            if(q.size()<k)
                q.push(nums[i]);
            else
                if(q.top() < nums[i])
                {
                    q.pop();
                    q.push(nums[i]);
                }
        }
        return q.top();
    }
};