leetcode Kth Largest Element in an Array

原题链接：https://leetcode.com/problems/kth-largest-element-in-an-array/

Description

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.

class Solution {public:    int findKthLargest(vector<int>& nums, int k) {        while (!q.empty()) q.pop();        for (auto &r : nums) q.push(r);        while (k > 1) { q.pop(); k--; }        return q.top();    }private:    struct cmp {        bool operator()(const int &A, const int &B) {            return A < B;        }    };    priority_queue<int, vector<int>, cmp> q;};