priority_queue优先队列中定义自己的比较算子

#include<bits/stdc++.h>
using namespace std;
struct node{
    int x,y,z;
    node(int a,int b,int c):x(a),y(b),z(c){}
    bool operator < (const node &rhs) const{
        return x < rhs.x;//按照x来定义优先顺序 
    }
};
int main(){
    priority_queue<node> q;
    q.push(node(3,4,5));
    q.push(node(4,5,6));
    q.push(node(2,3,4));
    while(!q.empty()){
        node t = q.top();
        q.pop();
        cout << t.x << " " << t.y << " " << t.z << endl;
    }
    return 0;
}
/*
    > 
    结果:
        2 3 4
        3 4 5
        4 5 6
    <
    结果:
        4 5 6
        3 4 5
        2 3 4
    结论:
        priority_queue中重载运算符与sort中重载运算符刚好相反 
*/