priority_queue

参照算法笔记P221

#include<stdio.h>//priority_queue<int>q 大顶堆   
#include<queue>//priority_queue<int,vector<int>,greater<int> >q 小顶堆   
using namespace std;   
int main(){  
    int n,x,i;  
    while(scanf("%d",&n)!=EOF){  
        priority_queue<int,vector<int>,greater<int> >q;//空格   
        for(i=0;i<n;i++){  
            scanf("%d",&x);  
            q.push(x);  
        }  
        int ans=0;  
        while(q.size()>1){  
            int a=q.top();  
            q.pop();  
            int b=q.top();  
            q.pop();  
            q.push(a+b);  
            ans=ans+a+b;  
        }  
        printf("%d\n",ans);  
    }  
}   

结构体

http://blog.csdn.net/lyw_321/article/details/78069794

#include<stdio.h>//priority_queue<int>q 大顶堆   
#include<queue>//priority_queue<int,vector<int>,greater<int> >q 小顶堆 
#include<string>  
#include<iostream> 
using namespace std; 
struct fruit{
	string name;
	int price;
	friend bool operator < (fruit f1,fruit f2){		//学会写法即可 
//		return f1.price > f2.price;		//按照price ,top 最小 
		return f1.price < f2.price;		//按照price ,top 最大 
	}
}f1,f2,f3;  
int main(){  
	priority_queue<fruit> q ;
	f1.name="桃子";
	f1.price=3;
	
	f2.name="梨子";
	f2.price=4;
	
	f3.name="苹果";
	f3.price=1;
	
	q.push(f1);
	q.push(f2);
	q.push(f3);
	 
	cout<<q.top().name<<" "<<q.top().price<<endl; 
}