读完题,自然而然就想到优先队列,没什么好说的,代码如下
#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> > q;
int n,a,ans;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
q.push(a);
}
while(q.size()>1){
int x=q.top();
q.pop();
int y=q.top();
q.pop();
int b=x+y;
q.push(b);
ans+=b;
}
cout<<ans;
return 0;
}