解答代碼

#include<iostream>#include<string>#include<cstring>#include<set>#include<algorithm>using namespace std;#define N 1024int main(){	int i,j,n,temp=0,data;	multiset<long long> s;	multiset<long long>::iterator pos;	s.clear();	cin>>n;	for(i=0;i<n;i++)	{		cin>>data;		s.insert(data);	}	long long result=0;	if(n>1)	{		while(true)		{			if(s.size()<2)				break;			pos=s.begin();			int a=(*pos);			s.erase(pos);			pos=s.begin();			int b=(*pos);			s.erase(pos);			result+=(a+b);			s.insert(a+b);				}	}	else	{		pos=s.begin();		result+=(*pos);	}	cout<<result<<endl;	return 0;}