remove, remove_if, remove_copy, and remove_copy_if

push_heap

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

The push_heap( ) algorithm pushes the element at end–1 onto the heap defined by start through end–1. The range specified by start and end–1 is assumed to represent a valid heap.

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