优先级队列priority_queue基本操作

来源：互联网发布：java构建工具ant 编辑：程序博客网时间：2024/05/06 04:26

传智扫地僧课程学习笔记。

直接看老师示例代码就行，

#include <iostream>using namespace std;#include "queue"void main81(){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(){main81();cout<<"hello..."<<endl;system("pause");return ;}

#include <iostream>using namespace std;#include "queue"void main81(){priority_queue<int> p1 ; //默认情况下 是 最大值优先级队列 priority_queue<int , vector<int>, less<int>> p2; //提前定义好的预定义函数  谓词priority_queue<int , vector<int>, greater<int> >  p3; //最小值优先级队列p1.push(33);p1.push(11);p1.push(55);p1.push(22);cout << "队头元素:" << p1.top() <<endl;cout << "队列的大小:" << p1.size() << endl;while (p1.size() > 0 ){cout << p1.top() << " ";p1.pop();}cout << "测试 最小值优先级队列 " << endl;p3.push(33);p3.push(11);p3.push(55);p3.push(22);cout << " 最小值优先级队列 队头元素:" << p3.top() <<endl;cout << " 最小值优先级队列 队列的大小:" << p3.size() << endl;while (p3.size() > 0 ){cout << p3.top() << " ";p3.pop();}}void main888(){main81();cout<<"hello..."<<endl;system("pause");return ;}

0 0