priority_queue 用法

#include<bits/stdc++.h>
using namespace std;
priority_queue<int>q;  //从大到小
priority_queue<int,vector<int>,greater<int> >Q;   //从小到大
//结构体元素类型：
struct node
{
    int x,y,z;
    friend bool operator <(const node &a,const node &b){
    return a.x>b.x;//（小顶）
    //（return a.x<b.x;大顶）
   }
};
priority_queue<node>QQ;
int main()
{
    for(int i=1;i<=5;i++){
        int tmp;
        scanf("%d",&tmp);
        q.push(tmp);
        Q.push(tmp);
    }
    while(!q.empty()){

        printf("%d ",q.top());
        q.pop();
    }
    printf("\n");
    while(!Q.empty()){
        printf("%d ",Q.top());
        Q.pop();
    }
    printf("\n");
    return 0;
}