// STL priority queue demo 1

#include <iostream>
#include <queue>
using namespace std;

int main()
{
    priority_queue<int> pq;

    // insert 3 elements
    pq.push(16);
    pq.push(50);
    pq.push(99);

	cout << "The size of the priority queue is " << pq.size() << endl;

    // print 2 elements
    cout << pq.top() << " ";
    pq.pop();
    cout << pq.top() << endl;
    pq.pop();

    // insert more elements
    pq.push(22);
    pq.push(66);
    pq.push(33);

    // skip one element
    pq.pop();

    // pop and print remaining elements
    while (!pq.empty()) 
	{
        cout << pq.top() << " ";
        pq.pop();
    }

    cout << endl;
}// end of main