This program illustrates the use of the STL pop_heap() algorithm (extended
version) to delete the top (root) (highest priority) (smallest) value from
a (minimum) heap of integers.
Press Enter to continue ...

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

Now we delete (pop) a value from the heap.
Press Enter to continue ...

Here are the revised contents of the vector:
2 3 25 7 17 100 36 19 1
Note that the value deleted from the heap is still
in the vector (at the end of the vector).
Press Enter to continue ...

So, we should reduce the size of the vector by 1, which we now do, and
then display the vector, which is once again a heap, one more time.
Press Enter to continue ...

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