#include <bits/stdc++.h>
using namespace std;
int n, a[300000], j = 0;
long long s = 0;
void merge(int arr[], int l, int m, int r) {
  int i, j, k;
  int n1 = m - l + 1;
  int n2 = r - m;
  int L[n1], R[n2];
  for (i = 0; i < n1; i++) L[i] = arr[l + i];
  for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
  i = 0;
  j = 0;
  k = l;
  while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
      arr[k] = L[i];
      i++;
    } else {
      arr[k] = R[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
  }
  while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
  }
}
void mergeSort(int arr[], int l, int r) {
  if (l < r) {
    int m = l + (r - l) / 2;
    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
  }
}
void sum() {
  int i;
  for (i = j; i < n; i++) s += a[i];
}
int main() {
  int i;
  long long temp, p = 0;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  mergeSort(a, 0, n - 1);
  sum();
  temp = s;
  while (j < n - 1) {
    s = s + temp - p;
    p += a[j];
    j++;
  }
  cout << s;
  return 0;
}
