priority_queue优先级重载

//#include <cstdio>#include <algorithm>#include <queue>#include <iostream>using namespace std;const int maxn = 1e3 + 10;int n,sum;struct  node{    friend bool operator<(node n1,node n2){        return n1.priority < n2.priority;    }    int priority;    int value;};int main(){    //priority_queue<int> q;默认的是从大到小    //或者 重构后的priority_queue<int,vector<int>,less<int>> q;    //如果从小到大    priority_queue<int,vector<int>,greater<int>> q;    scanf("%d",&n);    int a;    for(int i = 0; i < n; i++)        {            scanf("%d",&a);            q.push(a);        }    while(!q.empty()){        cout << q.top() << " ";        q.pop();    }    return 0;}