Defined in header <algorithm> template< class RandomIt >
void sort_heap( RandomIt first, RandomIt last ); (1) template< class RandomIt, class Compare >
void sort_heap( RandomIt first, RandomIt last, Compare comp ); (2)
Converts the max heap [first, last) into a sorted range in ascending order. The resulting range no longer has the heap property.
The first version of the function uses operator< to compare the elements, the second uses the given compariso