C++/STL Algorithms Heap/pop heap

Use pop_heap to pop next element out of the heap

<source lang="cpp">

/* The following code example is taken from the book

* "The C++ Standard Library - A Tutorial and Reference"
* by Nicolai M. Josuttis, Addison-Wesley, 1999
*
* (C) Copyright Nicolai M. Josuttis 1999.
* Permission to copy, use, modify, sell and distribute this software
* is granted provided this copyright notice appears in all copies.
* This software is provided "as is" without express or implied
* warranty, and with no claim as to its suitability for any purpose.
*/

1. include <iostream>
2. include <vector>
3. include <deque>
4. include <list>
5. include <set>
6. include <map>
7. include <string>
8. include <algorithm>
9. include <iterator>
10. include <functional>
11. include <numeric>

/* PRINT_ELEMENTS()

* - prints optional C-string optcstr followed by
* - all elements of the collection coll
* - separated by spaces
*/

template <class T> inline void PRINT_ELEMENTS (const T& coll, const char* optcstr="") {

   typename T::const_iterator pos;
   std::cout << optcstr;
   for (pos=coll.begin(); pos!=coll.end(); ++pos) {
       std::cout << *pos << " ";
   }
   std::cout << std::endl;

} /* INSERT_ELEMENTS (collection, first, last)

* - fill values from first to last into the collection
* - NOTE: NO half-open range
*/

template <class T> inline void INSERT_ELEMENTS (T& coll, int first, int last) {

   for (int i=first; i<=last; ++i) {
       coll.insert(coll.end(),i);
   }

}

using namespace std; int main() {

   vector<int> coll;
   INSERT_ELEMENTS(coll,3,7);
   INSERT_ELEMENTS(coll,5,9);
   INSERT_ELEMENTS(coll,1,4);
   PRINT_ELEMENTS (coll, "on entry:           ");
   // convert collection into a heap
   make_heap (coll.begin(), coll.end());
   PRINT_ELEMENTS (coll, "after make_heap():  ");
   // pop next element out of the heap
   pop_heap (coll.begin(), coll.end());
   coll.pop_back();
   PRINT_ELEMENTS (coll, "after pop_heap():   ");

}

/* 

on entry: 3 4 5 6 7 5 6 7 8 9 1 2 3 4 after make_heap(): 9 8 6 7 7 5 5 3 6 4 1 2 3 4 after pop_heap(): 8 7 6 7 4 5 5 3 6 4 1 2 3

*/       
 </source>