C++STL优先队列

#include<stdio.h>  
#include<queue>  
#include<vector>  
using namespace std;  
//重载运算符(),自定义优先级1  
struct cmp1{  
    bool operator ()(int &a,int &b){  
        return a>b;//最小值优先  
    }  
};  
struct cmp2{  
    bool operator ()(int &a,int &b){  
        return a<b;//最大值优先  
    }  
};  
//重载运算符<,自定义优先级2  
struct number1{  
    int x;  
    bool operator < (const number1 &a) const {  
        return x>a.x;//最小值优先  
    }  
};  
struct number2{  
    int x;  
    bool operator < (const number2 &a) const {  
        return x<a.x;//最大值优先  
    }  
};  
int main()  
{   
	priority_queue<int>que;//默认认优先级，从小到大 
  
    priority_queue<int,vector<int>,cmp1>que1;//最小值优先  
    priority_queue<int,vector<int>,cmp2>que2;//最大值优先  

    priority_queue<number1>que3;  // 最小值优先 
    priority_queue<number2>que4;  //最大值优先 
    
    return 0;  
}