215_Kth_Largest_Element_in_an_Array.cpp

//Using Priority Queue
class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int> pq;
        
        for(int i = 0; i < nums.size(); i++)
            pq.push(nums[i]);
        
        int ans = 0;
        while(!pq.empty() && k > 0){
            if(k == 1) ans = pq.top();
            pq.pop();
            k--;
        }
        return ans;
    }
};

//Using Sort
class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end());
        for(int i = nums.size() - 1; i >= 0; i--){
            k--;
            if(k == 0) return nums[i];
        }
        return 0;
    }
};