#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;

int main(){
    int n,i,j;
    long long sum;

    while(scanf("%d",&n) != EOF){
        long long length[n];
        for(i = 0; i < n; i++){
            scanf("%I64d",&length[i]);
        }
        sort(length,length+n);
        i = 0;
        sum = 0;

        while(i < n-1){
            length[i+1] = length[i] + length[i+1];
            sum += length[i+1];
            for(j = i+1; j < n-1; j++){
                if(length[j] > length[j+1]){
                    swap(length[j],length[j+1]);
                }
            }
            i++;
        }

        printf("%I64d\n",sum);
    }
}
数据再大点估计会超时orz