穿越隧道
#include <iostream>
#include <algorithm>
#include <cmath>
// #includ
using namespace std;
typedef long long ll;
const int N = 1e3 + 10;
int a[N];
int n;
ll ans;
int main()
{
// 请在此输入您的代码
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a,a + n);
for(int i = 1; i < n; i++){
// ans += a[i - 1] + a[i];
// printf("%d; ans=%d,a[%d] = %d,a[%d]=%d\n",i,ans,i-1,a[i-1],i,a[i]);
a[i] += a[i - 1];
ans += (1ll)*a[i];
}
cout << ans << endl;
return 0;
}