How to use the pop_heap() in C++ coding

[Garrick]

I am the student of the Bsc-CS. I must have to submit the assignment on the functions of the C++ library in four days. I could also had the well knowledge of the functions that could be used in the C++ programming language. Even though, I could not know much more about the pop_heap() function of the C++ programming language. So, I would like to know about the pop_heap() function of the C++ programming language. I also would like to know How to use the pop_heap() in C++ coding. Reply Me!!

[Praetor]

The pop_heap() function can be used for an element that can be from the given heap range to pop that an element. The pop_heap() function can re-sequence an elements in the given specified range [fst,lst) in such a manner that the some place of considered a heap can be narrowed by one by deleting its highest an element. The following can be the general syntax of the pop_heap() function in the C++ :

template <class RndmAcsItrtr>
  void pop_heap ( RndmAcsItrtr fst, RndmAcsItrtr lst );

[Katty]

The program that can be mentioned below illustrates you about how to use the pop_heap() function in the C++ language programming :

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main () 
{
  int mit[] = {10,20,30,5,15};
  vector<int> w(mit,mit+5);
  vector<int>::iterator it;
  make_heap (w.begin(),w.end());
  cout << "initial max heap   : " << w.front() << endl;
  pop_heap (w.begin(),w.end()); w.pop_back();
  cout << "max heap after pop : " << w.front() << endl;
  w.push_back(99); push_heap (w.begin(),w.end());
  cout << "max heap after push: " << w.front() << endl;
  sort_heap (w.begin(),w.end());
  cout << "final sorted range :";
  for (unsigned k=0; k<w.size(); k++) cout << " " << w[k];
  cout << endl;
  return 0;
}

Output:

initial max heap   : 30
max heap after pop : 20
max heap after push: 99
final sorted range : 5 10 15 20 99

[kelfro]

The following can be the parameters of the pop_heap() function of the C++ language :
1. comp : This parameter of the pop_heap() function can contains an object of the comparison function that can takes two values of the similar type than those can consisted in the given specified range.
2. fst, lst : These parameters of the pop_heap() function can contains the random-Access iterators to the final and starting positions of the heap that can be shrank by one. The range used can be as [fst,lst) that can contains all of an elements that can be between fst and lst.

[Zecho]

The pop_heap() function of the C++ language can be used to delete the highest an element that can be defined as an element at the front of the heap from the specified heap. If an object of the weak sequencing comparison function can be given then it can be used instead of the "<" operator to compare an elements. The pop_heap() function can runs in a logarithmic time. The pop_heap() function of the C++ language can be comes under the <algorithm> header files.