题解 | #寻找第K大#

import java.util.*;

public class Solution {
    public int findKth(int[] a, int n, int K) {
        // write code here
        int ans = 0;
        PriorityQueue<Integer> queue = new PriorityQueue<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2 - o1;
            }
        });
        for (int i : a) {
            queue.add(i);
        }
        while (K > 0) {
            ans = queue.poll();
            K--;
        }
        return ans;
    }
}