import java.util.PriorityQueue; public class 优先队列 { public static void main(String[] args) { // 最小堆 PriorityQueue<Integer> q = new PriorityQueue<>(10); for (int i = 0; i < 1000; i++) { int a=(int) (Math.random()*1000); if (q.isEmpty() || q.size() < 10) { q.offer(a); } else { if (q.peek() < a) { q.poll(); q.offer(a); } } } System.out.println(q); } }