Kth Largest Element in an Array - LeetCode 215

题目描述：

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.

分析：
要找到一个数组中的第k大的元素，只需先将数组排序，然后返回第k大的元素即可。可以直接调用C++库的sort函数，将数组非递减排序后输出即可。

以下是C++实现代码：

/*8ms//*/
class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        int size = nums.size();
        if(size == 0)
            return 0;
            
        sort(nums.begin(),nums.end());
        return nums[size - k];
        
    }
};