C++ priority_queue，sort 自定义比较函数

#include <iostream>
#include<stdio.h>
#include<vector>
#include<math.h>
#include<queue>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include<stdio.h>
#include<vector>
#include<math.h>
#include<queue>
#include<string>
#include<algorithm>
#include<unordered_set>
#include<unordered_map>
#include<stack>
#include<set>
using namespace std;
struct node{
    int x;
    node(){}
    node(int a):x(a){}
}a[3];
struct cmp{
    bool operator()(node a,node b){
        return a.x>b.x;
    }
};
int main()
{
    priority_queue<node,vector<node>,cmp> q;
    q.push({5});
    q.push({3});
    q.push({7});
    printf("priority_queue results : ");
    while(!q.empty()){
        printf(" %d ",q.top().x);
        q.pop();
    }
    printf("\n");
    a[0].x=5;
    a[1].x=3;
    a[2].x=7;
    sort(a,a+3,cmp());
    printf("sort results : ");
    for(auto tmp:a){
        printf(" %d ",tmp.x);
    }
    return 0;
}

输出结果为：

    priority_queue results :  3  5  7
    sort results :  7  5  3