leetcode 215. Kth Largest Element in an Array

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.

Note:

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

解题思路

只用堆就搞定了

class Solution {
public:
	int findKthLargest(vector<int>& nums, int k) {
		priority_queue<int> heap;
		
		for (auto e : nums) {
			heap.push(e);
		}

		int temp;
		for (int i = 0; i < k; i++) {
			temp = heap.top();
			heap.pop();
		}

		return temp;
	}
};

反思

Your runtime beats 42.66% of cppsubmissions.

但是显然有更好的解决方案，如上提示。