STL学习系列七：优先级队列priority_queue容器

#include<iostream>
#include <algorithm>
#include<functional>
#include <queue>
using namespace std;
void objPlay()
{

priority_queue<int> p1; //默认是 最大值优先级队列
//priority_queue<int, vector<int>, less<int> > p1; //相当于这样写
priority_queue<int, vector<int>, greater<int> > p2; //最小值优先级队列

p1.push(33);
p1.push(11);
p1.push(55);
p1.push(22);
cout << "测试 最小值优先级队列" << endl;
cout << "队列大小" << p1.size() << endl;
cout << "队头" << p1.top() << endl;

while (p1.size() > 0)
{
cout << p1.top() << " ";
p1.pop();
}

cout << endl;
cout << "**************************" << endl;

p2.push(33);
p2.push(11);
p2.push(55);
p2.push(22);
cout << "测试 最小值优先级队列" << endl;
cout << "队列大小" << p2.size() << endl;
cout << "队头" << p2.top() << endl;
while (p2.size() > 0)
{
cout << p2.top() << " ";
p2.pop();

}
cout << endl;
}

int main()
{
objPlay();

system("pause");
return 0;
}