C++-优先级队列

C++-优先级队列

#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
struct note {
int x;
int y;
int k;
friend bool operator < (note a, note b) {
return a.k < b.k;
}
};
int main() {
priority_queue<note> q;
struct note n[5];
n[0].x = 0;n[0].y = 1;n[0].k = 1;
n[1].x = 0;n[1].y = 1;n[1].k = 3;
n[2].x = 0;n[2].y = 1;n[2].k = 2;
n[3].x = 0;n[3].y = 1;n[3].k = 6;
n[4].x = 0;n[4].y = 1;n[4].k = 5;
for (int i = 0; i < 5; i++) q.push(n[i]);

while(q.size()) {
note n1 = q.top();q.pop();
printf("x = %d, y = %d, k = %d\n",n1.x, n1.y, n1.k);
}

return 0;
}

x = 0, y = 1, k = 6
x = 0, y = 1, k = 5
x = 0, y = 1, k = 3
x = 0, y = 1, k = 2
x = 0, y = 1, k = 1

friend bool operator < (note a, note b) {
return a.k < b.k;
}