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.
1 class Solution { 2 public: 3 int findKthLargest(vector<int>& nums, int k) { 4 sort(nums.begin(),nums.end()); 5 int len=nums.size(); 6 7 return nums[len-k]; 8 } 9 };
【leetcode】Kth Largest Element in an Array
原文：http://www.cnblogs.com/jawiezhu/p/4537713.html