Answers for "priority queuein cpp"

priority queue stl

#include<iostream>
#include<queue>
#include<algorithm>

using namespace std;

int main()
{
    priority_queue<int>pq;
    int n=5;
    while(n--)
    {
        int val;
        cout<<"enter the value you want to insert:"<<endl;
        cin>>val;
        pq.push(val);
    }
    priority_queue<int>p;
    p.push(100);
    p.push(1000);
    p.push(3000);
    p.push(5000);
    pq.swap(p);
    while(!pq.empty())
    {
        cout<<pq.top()<<" ";
        pq.pop();
    }
    return 0;
}