【leetcode】215. Kth Largest Element in an Array

题目：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.

分析：可以从大到小排序之后便可以快速解决

代码：

#include <iostream>

#include <vector>

#include <algorithm>

#include<functional>

using namespace std;

class Solution {

public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(),nums.end(),greater<int>());
return nums[k-1];
}

};