stl中优先队列的使用方法
#include<iostream>
#include<vector>
#include<queue>
#include<functional>
#include<ctime>
#include<cstdlib>
using namespace std;
//自定义比较函数(最小堆)
struct cmp{
bool operator()(const int &a, const int &b){
return a > b;
}
};
int main()
{
srand((unsigned)time(0));
priority_queue<int> q1; //最大堆
for(int i=0; i<10; i++){
q1.push(rand()%10);
}
priority_queue<int, vector<int>, cmp> q2; //最小堆
for(int i=0; i<10; i++){
q2.push(rand()%10);
}
priority_queue<int, vector<int>, less<int> > q3; //最大堆
for(int i=0; i<10; i++){
q3.push(rand()%10);
}
priority_queue<int, vector<int>, greater<int> > q4; //最小堆
for(int i=0; i<10; i++){
q4.push(rand()%10);
}
while(!q1.empty()){
cout<<q1.top();
q1.pop();
}
cout<<endl;
while(!q2.empty()){
cout<<q2.top();
q2.pop();
}
cout<<endl;
while(!q3.empty()){
cout<<q3.top();
q3.pop();
}
cout<<endl;
while(!q4.empty()){
cout<<q4.top();
q4.pop();
}
cout<<endl;
return 0;
}