#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
LL q[N];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> q[i];
sort(q, q + n); //从小到大排序,花费时间最少的人排前面
LL res = 0;
for (int i = 0; i < n; i ++ )
res += q[i] * (n - i - 1); //有n-i-1个人要等第i个人q[i]个小时
cout << res << endl;
return 0;
}