数据好, 感觉是个假题,,,
#include <bits/stdc++.h>
using namespace std;
#define ls st<<1
#define rs st<<1|1
#define LL long long
const int MAXN= (int) 26;
int arr[MAXN];
bool check(char ch) {
return ch>='A'&&ch<='Z';
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
sort(arr, arr+n);
int k = n;
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += (arr[i]*k);
k--;
}
cout << sum << endl;
return 0;
}