title: Java PriorityQueue with fixed size
body: <p>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. Currently, there are about 200k items in that  queue which is pretty much memory intesive. Acutally, I only need lets say the best 1000 or 100 of all items in the list.
  So I just started to ask myself if there is a way to have a priority queue with a fixed size in Java. I should behave like this:
  Is the item better than one of the allready stored? If yes, insert it to the according position and throw the element with the least rating away.</p>
  
  <p>Does anyone have an idea? Thanks very much again!</p>
  
  <p>Marco</p>