2个AC代码

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;
	priority_queue<int,vector<int>,greater<int>>heap;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		heap.push(x);
	}
	int cnt=0;
	while(heap.size()>1){
		int a,b;
		a=heap.top();
		heap.pop();
		b=heap.top();
		heap.pop();
		cnt+=a+b;
		heap.push(a+b);
	}
	cout<<cnt;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int arr[10005];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	sort(arr+1,arr+n);
	int cnt=0;
	for(int i=1;i<n;i++){
		cnt+=arr[i]+arr[i+1];
		arr[i+1]=arr[i]+arr[i+1];
		sort(arr+i+1,arr+n+1);
	}
	cout<<cnt;
	return 0;
}