push_heap

pop_heap

template <class RandIter>    void pop_heap(RandIter start, RandIter end);template <class RandIter, class Comp>     void pop_heap(RandIter start, RandIter end, Comp cmpfn);

The pop_heap( ) algorithm exchanges the start and end–1 elements and then rebuilds the heap using the range start through end–1. Thus, the first element of the original heap is removed and a new heap is constructed that consists of the remaining elements. Although the element is removed from the heap, it is still present in the container.

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