Kth Largest Element in an Array
nums=[3, 2, 1, 5, 6, 4],k=2
1public int findKthLargest(int[] nums, int k) {
2 PriorityQueue<Integer> minHeap = new PriorityQueue<>(k);
3
4 for (int num : nums) {
5 minHeap.add(num);
6
7 if (minHeap.size() > k) {
8 minHeap.poll();
9 }
10 }
11
12 return minHeap.peek();
13}