Kth Largest Element In An Array Problem


Description

LeetCode Problem 215.

Given an integer array nums and an integer k, return the k^th largest element in the array.

Note that it is the k^th largest element in the sorted order, not the k^th distinct element.

Example 1:

1
2
Input: nums = [3,2,1,5,6,4], k = 2
Output: 5

Example 2:

1
2
Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
Output: 4

Constraints:

  • 1 <= k <= nums.length <= 10^4
  • -10^4 <= nums[i] <= 10^4


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int> pq(nums.begin(), nums.end());
        for (int i = 0; i < k - 1; i++) {
            pq.pop();
        }
        return pq.top();
    }
};




Related Posts

K-Th Smallest Prime Fraction Problem

LeetCode 786. You are given a sorted integer array arr...

Course Schedule III Problem

LeetCode 630. There are n different online courses numbered from...

IPO Problem

LeetCode 502. Suppose LeetCode will start its IPO soon. In...

Sliding Window Median Problem

LeetCode 480. The median is the middle value in an...

Relative Ranks Problem

LeetCode 506. You are given an integer array score of...

Ugly Number II Problem

LeetCode 264. An ugly number is a positive integer whose...