class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int, vector<int>, greater<int>> minHeap;
for(auto& n: nums) {
minHeap.push(n);
if(minHeap.size() > k) {
minHeap.pop();
}
}
return minHeap.top();
}
};
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(), nums.end());
return nums[nums.size()-k];
}
};