|
| |
| A priority_queue: size(), top(), empty(), pop() |
|
|
#include <queue>
#include <iostream>
int main ()
{
using namespace std;
priority_queue <int> pqIntegers;
pqIntegers.push (10);
pqIntegers.push (5);
pqIntegers.push (-1);
pqIntegers.push (20);
cout << "The queue contains " << pqIntegers.size () << " elements";
cout << endl;
cout << "Element at the top: " << pqIntegers.top () << endl << endl;
while (!pqIntegers.empty ())
{
cout << "Deleting the topmost element: " << pqIntegers.top ();
cout << endl;
pqIntegers.pop ();
}
return 0;
}
|
|
|
| Related examples in the same category |
|