题解 | 第k轻的牛牛

import java.util.*;

public class Solution {
    public int findKthSmallest (int[] weights, int k) {
        PriorityQueue<Integer> maxHeap = new PriorityQueue<>(k + 1, (o1, o2) -> (o2 - o1));
        for (int w : weights) {
            maxHeap.add(w);
            if (maxHeap.size() == k + 1) {
                maxHeap.poll();
            }
        }
        return maxHeap.peek();
    }
}