Kth Largest_Element_in_an_Array.java

import java.util.*;
class Solution {
    public int findKthLargest(int[] nums, int k) {
        Queue<Integer> minHeap = new PriorityQueue<>();
        for(int num : nums){
            minHeap.add(num);
            if(minHeap.size()>k)minHeap.poll();
        }
        return minHeap.peek();
    }
}