http://ac.jobdu.com/problem.php?id=1107 搬水果

#include<iostream> #include<queue> #include<vector> using namespace std; #include<stdio.h> int main(void) { int i,n,m,a,b,sum; //使用优先队列 priority_queue<int,vector<int>,greater<int> >q; //从小到大排序 while(scanf("%d",&n),n) { while(!q.empty()) q.pop(); for(i=0;i<n;i++) { scanf("%d",&m); q.push(m); } sum=0; while(q.size()>2) { a=q.top(); q.pop(); b=q.top(); q.pop(); a+=b; sum+=a; q.push(a); } if(q.size()==2) { a=q.top(); q.pop(); b=q.top(); q.pop(); sum=sum+a+b; printf("%d\n",sum); } else if(q.size()==1) { printf("%d\n",q.top()); q.pop(); } } return 0; }