#include <queue>
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
struct myps{
int index;
int val;
myps(int x = 1, int y = 2):index(x), val(y){}
// less 最大堆需要
friend bool operator < (const myps& px, const myps& py){
return px.val < py.val;
}
// greater 最小堆需要
friend bool operator > (const myps& px, const myps& py){
return px.val > py.val;
}
};
int main(){
myps *p = new myps[10];
priority_queue<myps, vector<myps>, greater<myps> > pri; // greater最小堆, less最大堆
for(int i=0;i<10;i++){
p[i].index = i;
p[i].val = i+4;
pri.push(p[i]);
}
while(!pri.empty()){
myps p = pri.top();
pri.pop();
cout << p.index << " " << p.val << endl;
}
}
C++ usage of priority queue
最新推荐文章于 2024-04-07 21:46:52 发布