优先队列的使用

#include<iostream>
#include<string>
#include<queue>
#include<functional>
using namespace std;
template<typename priorityQ>
void printpq( const string& str, priorityQ& pr)
{
cout << str << ':' << endl;
cout <<"prsize:"<< pr.size() << endl;
cout << "if empty:" << pr.empty() << endl;
while (!pr.empty())
{
cout << pr.top()<<' ';
pr.pop();
}
cout << endl;
}
int main()
{
priority_queue<int> maxQ;
priority_queue<int, vector<int>, greater<int> > minQ;
maxQ.push(3); minQ.push(3);
maxQ.push(5); minQ.push(5);
maxQ.push(4); minQ.push(4);
maxQ.push(6); minQ.push(6);
printpq("maxQ", maxQ);
printpq("minQ", minQ);
return 0;
}