#include
#include
int main ()
{
using namespace std;
priority_queue , greater > 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 << "pop the topmost element " << pqIntegers.top ();
pqIntegers.pop ();
}
return 0;
}