#263 (div.1) A. Appleman and Toastman

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<functional>
using namespace std;

#define me(s) memset(s,0,sizeof(s))
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair <int, int> P;

const int N=300000+10;
int a
;
ll sum
;

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        me(sum);me(a);
        ll ans=0;
        for(int i=1;i<=n;i++)
         {
             scanf("%d",&a[i]);
         }
         sort(a+1,a+n+1);
         for(int i=1;i<=n;i++)
            sum[i]=sum[i-1]+a[i];
        for(int i=1;i<=n;i++)
        {
            ans+=sum
-sum[i-1];
            ans+=a[i-1];
        }
        printf("%I64d\n",ans);
    }
}