Defined in header <algorithm> template< class RandomIt >
void push_heap( RandomIt first, RandomIt last ); (1) template< class RandomIt, class Compare >
void push_heap( RandomIt first, RandomIt last,
Compare comp ); (2)
Inserts the element at the position last-1 into the max heap defined by the range [first, last-1). The first version of the function uses operator< to compare the elements, the second uses the given comparison function com