leetcode215

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

补充python的实现，使用堆排序：

import heapq
class Solution:
    def findKthLargest(self, nums: 'List[int]', k: 'int') -> 'int':
        lists = heapq.nlargest(k,nums)
        return lists[-1]