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

Note:
You may assume k is always valid, 1 ≤ k ≤ array's length.

做法比较简单，直接利用sort函数，输出第size-k个元素。

我的代码：

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        int a[nums.size()];
        for(int i=0;i<nums.size();i++){
            a[i]=nums[i];
        }
        sort(a,a+nums.size());
        return a[nums.size()-k];
    }
};