package chelper;

import java.util.Arrays;

import io.InputReader;
import io.OutputWriter;
import misc.SimpleSavingChelperSolution;


public class D extends SimpleSavingChelperSolution {

  public void solve(int testNumber, InputReader in, OutputWriter out) {
    wrapSolve(testNumber, in, out);
  }

  @Override
  public void solve(int testNumber) {
    int n = in.nextInt();

    long[] a = in.nextLongArray(n);

    Arrays.sort(a);
    
    long t = 0;
    long ans = 0;
    for (int i = 0; i < n; i++) {
      t += a[i];
    }

    int i = n - 1;
    while (i > 0) {
      ans += t;
      t -= a[i];
      i--;
      if (i > 0) {
        t -= a[i];
        i--;
      }
    }
    out.println(ans);
  }
}