题解 | #寻找第K大#

import java.util.*;

public class Solution {
    public int findKth(int[] a, int n, int k) {
        PriorityQueue<Integer> queue = new PriorityQueue<>(k);
        for(int val : a){
            if(queue.size() == k){
                if(queue.peek() > val) continue;
                queue.poll();
            }
            queue.offer(val);
        }
        return queue.poll();
    }
}