题解

#include<iostream>
#include<queue>
using namespace std;
int main(){
    int n,x,ans=0;
	cin>>n; 
    priority_queue<int,vector<int>,greater<int> > q;
    for(int i=0;i<n;i++){
    	cin>>x;
    	q.push(x);
	}
	while(q.size()>1){
		int i=q.top();
		q.pop();
		int j=q.top();
		q.pop();
		ans+=i+j;
		q.push(i+j);
	}
	cout<<ans;
	return 0;
}