#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
priority_queue<int,vector<int>, greater<int> > num;
for (int i=0;i<n;i++) {
int tmp;
cin>>tmp;
num.push(tmp);
}
int a,ans;
while (num.size()>=2){
a=num.top();
num.pop();
a+=num.top();
num.pop();
num.push(a);
ans+=a;
}
cout<<ans<<endl;
return 0;
}
P1090 [NOIP2004 提高组] 合并果子
最新推荐文章于 2024-10-06 10:17:48 发布