poj 3253

用优先队列，复杂度为nlogn

代码如下

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<queue>using namespace std;int main(){int n;scanf("%d",&n);priority_queue<int,vector<int>,greater<int> >q;for(int i=0;i<n;i++){int temp;scanf("%d",&temp);q.push(temp);}long long ans=0;while(q.size()>1){int l1,l2;l1=q.top();q.pop();l2=q.top();q.pop();ans+=l1+l2;q.push(l1+l2);}printf("%lld\n",ans);}