只对了1/10

#include<bits/stdc++.h>
using namespace std;
int a[10001];
int i,n,j,m,k,l,x;
long long ans;
bool cmp(int a,int b){
    return a>b;
}    
int main(){
    cin>>n;
    for (i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+1+n,cmp);
    i=n-1;
    while (i!=0){
        a[i]=a[i]+a[i+1];
        x=a[i];
        for (j=i;j>=1;j--) if (x>a[i-1]) a[i]=a[i-1];else break;
        a[j]=x;
        ans+=x;
        i--;
    }    
    cout<<ans;
    return 0;
}
why does it wrong？？？