pop_heap

partial_sort_copy

template <class InIter, class RandIter>    RandIter partial_sort_copy(InIter start, InIter end,                                RandIter res_start, RandIter res_end); template <class InIter, class RandIter, class Comp>     RandIter partial_sort_copy(InIter start, InIter end,                                RandIter res_start, RandIter res_end,                                Comp cmpfn);

The partial_sort_copy( ) algorithm sorts the range start to end and then copies as many elements as will fit into the resulting sequence defined by res_start and res_end. It returns an iterator to one past the last element copied into the resulting sequence.

The second form allows you to specify a comparison function that determines when one element is less than another.