解题思路:
(1)优先队列+小顶堆
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int,vector<int>,greater<int> > p;
for(int i=0;i<nums.size();i++) {
if(p.size()<k) p.push(nums[i]);
else if(p.size()==k && nums[i]>=p.top()) {
p.push(nums[i]);
p.pop();
}
}
return p.top();
}
};