Codeforces Round #263 (Div. 2)C(贪心，联想到huffman算法)

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
using namespace std;
#define INF 1000000000
#define eps 1e-8
#define pii pair<int,int>
#define LL long long int
const int maxn=310009;
int n;
LL ans=0,a[maxn];
int main()
{
    //freopen("in6.txt","r",stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%I64d",&a[i]);
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n-1;i++) ans+=(i+1)*a[i];
    ans+=n*a[n];
    cout<<ans<<endl;
}