原题:
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
用一个multiset来解决就可以了。
代码:
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
For example,
Given [3,2,1,5,6,4]
and k = 2, return 5.
Note:
You may assume k is always valid, 1 ≤ k ≤ array's length.
用一个multiset来解决就可以了。
代码:
int findKthLargest(vector<int>& nums, int k) {
multiset<int> s(nums.begin(), nums.end());
while(s.size() > k)
s.erase(s.begin());
return *s.begin();
}