Java PriorityQueue with fixed size

Question

I am calculating a large number of possible resulting combinations of an algortihm. To sort this combinations I rate them with a double value und store them in PriorityQueue

Answer 1

It seems natural to just keep the top 1000 each time you add an item, but the PriorityQueue doesn't offer anything to achieve that gracefully. Maybe you can, instead of using a PriorityQueue, do something like this in a method:

List list = new ArrayList();
...
list.add(newOutput);
Collections.sort(list);
list = list.subList(0, 1000);