题解

#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[100005];
int main(){
priority_queue<long long,vector<long long>,greater<long long>>q;
cin>>n;
for(int i=1;i<=n;i++){
int x;
cin>>x;
q.push(x);
}
long long tl=0;
while(q.size()>=2){
int t = q.top();
q.pop();斜体文本
int s = q.top();
q.pop();
tl += s + t;
q.push(s + t);
}
cout<<tl;
return 0;
}