c++ 优先级队列自定义比较函数_队列发送优先级

#include <iostream>
using namespace std;
#include "queue"    //头文件 

void Operator()
{
	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 <<"队列大小" << 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);
	
	while (p2.size() > 0)
	{
		cout << p2.top() << " ";
		p2.pop();
	}
}
void main()
{
	Operator();
	cout<<"hello..."<<endl;
	while(1);
	return ;
}