Re: Selecting Container for "Top 20" Application

I am looking for an STL container that will efficiently handle a "Top
20" list. Specifically, I have >300,000 data records that I must scan
to find and store the highest 20 values.
   None of the available STL containers seems well suited for this
application. For example:
 - array, even though fixed in size, seems cumbersome to use: no delete
or erase function is available; insertion at some point is difficult;
etc. Replacement of the "end value" and sorting might work, but it's
tedious and slow...
 - vector, while having insert & erase functions, incurs repeated size
expansion (expensive!) and truncation to maintain a fixed size.
Appending a new value if it's greater than the 20th element, followed by
sorting and truncation might be less work, but it might be very slow to
execute.
 - queue/deque, set, and stack seem inappropriate for this application,
and the others (map, list, etc.) are completely unusable here.
   Am I missing something? Is/are there reasonably efficient ways to
use array or vector that are appropriate? TIA