priority_queue_all_opretion.cpp

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

int main()
{
	priority_queue<int>pq;
	int a[]={2,5,3,1,4};
	
	for(int i=0;i<5;i++)
	{
		pq.push(a[i]);	
	}
	
	while(!pq.empty()){
		cout<<pq.top();
		pq.pop();
	}
	return 0;
}