This program illustrates the use of the STL make_heap() algorithm (extended
version) to convert an arbitrary vector of integers into a heap. In this case,
the built-in predicate functor greater<int>() is used to order the values.
Press Enter to continue ...

Here are the values in the vector:
25 17 36 2 3 100 1 19 7
Press Enter to continue ...

Now we make these values into a (minimum) heap.
Press Enter to continue ...

Here are the revised contents of the vector:
1 2 25 7 3 100 36 19 17
Press Enter to continue ...