题解 100% AC

#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
int main(){
	priority_queue<int,vector<int>,greater<int>>pq;
	int n,cnt=0;
	cin>>n;
	while(n--){
		int x;
		cin>>x;
		pq.push(x);
	}
	while(pq.size()!=1){
		int x=pq.top();
        pq.pop();
        int y=pq.top();
        cnt+=x+y;
		pq.push(x+y);
        pq.pop();
	}
    cout<<cnt;
	return 0;
}