題目來(lái)源      點(diǎn)擊打開(kāi)鏈接
題目詳情    
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.
Credits:
Special thanks to @mithmatt for adding this PRoblem and creating all test cases
Subscribe to see which companies asked this question.
題目解答     
class Solution {public:    int findKthLargest(vector<int>& nums, int k) {        sort(nums.begin(),nums.end());        return nums[nums.size() - k];    }};