优先队列（priority_queue）四种自定义排序方法

#include
#include
#include
using namespace std;
struct cmp{
	 
	    bool  operator ()  ( int  r , int  l  ){
	   	      return r > l;
	   } 
}; 
struct cmp1{
	   bool operator ()( int a ,int b ){
	   	   return a q;// 默认是 从大到小。 
	 //   priority_queue < int , vector ,less > q;//从大到小 
	 //   priority_queue < int , vector, greater > q; //从小到大，需要vector
	 //  priority_queue < int , vector , cmp1  > q;//从大到小，需要vector
	 //   priority_queue < int , vector , cmp  > q;//从小到大，需要vector
	 q.push( 1 );
	 q.push( 2 );
	 q.push( 3 );
	 
	 while( !q.empty() ){
	      int t =q.top();
	     q.pop();
	     printf("%d ",t);
	  
	 } 
	  return 0;
}