215. Kth Largest Element in an A

Kth Largest Element in an Array
思路很直接，建立大根堆，然后依次弹出就好。

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        //k总是有效，那么nums非空
        int result = 0;
        make_heap(nums.begin(),nums.end());
        while(k > 0)
        {
            pop_heap(nums.begin(),nums.end());
            result = nums.back();
            nums.pop_back();
            --k;
        }
        return result;
    }
};