合并果子

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int a[2016]; 
int main(){
	int i,j,k,m,n,ans=0;
	cin>>n;
	for(i=1;i<=n;i++)
	cin>>a[i];
	for(i=1;i<=n-1;i++){
		int sum=0; 
		int zx=1000000;
		for(j=1;j<=n;j++)
		   if(a[j]<zx){
		   	  zx=a[j];
				k=j;
		   } 
		sum=sum+zx;
		a[k]=10000000;
		zx=1000000;
		for(j=1;j<=n;j++)
		   if(a[j]<zx){
		   	zx=a[j];
			   k=j;
		   }
		sum=sum+zx;
		a[k]=sum;
		ans=ans+sum;
	} 
	cout<<ans<<endl;
	return 0;
}