题解 | #寻找第K大 堆#

import java.util.*;

public class Solution {
    public int findKth(int[] a, int n, int K) {
        // write code here
        // 大根堆
        PriorityQueue<Integer> heap = new PriorityQueue<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2 -o1;
            }
        });
        for (int i = 0; i < n; i++) {
            heap.offer(a[i]);
        }
        for (int i = 0; i < K - 1; i++) {
            heap.poll();
        }
        return heap.poll();
    }
}