Kth largest element(priority queue).cpp

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int>pq;
        int n=nums.size();
        for(int i=0;i<n;i++)
        {
            pq.push(nums[i]);
        }
        int f=k-1;
        while(f>0)
        {
            pq.pop();
            f--;
        }
        return pq.top();
        
    }
};