11399 ATM

#include <stdio.h>
 
int arr[1001] = { 0 };
 
void qSort(int left, int right) {
    int l = left+1, r= right, num = arr[left];
 
    do {
        while (arr[l] <= num && l<right) l++;
        while (num <= arr[r] && r>left) r--;
 
        if (l < r) {
            int tmp = arr[l];
            arr[l] = arr[r];
            arr[r] = tmp;
        }
    } while (l < r);
 
    int tmp = arr[r];
    arr[r] = arr[left];
    arr[left] = tmp;
 
    if(left<r-1)    qSort(left, r - 1);
    if (r + 1 < right)    qSort(r + 1, right);
}
 
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) 
        scanf("%d", &arr[i]);
    
    qSort(0, n-1);
    
    int rst = 0;
    int temp = 0;
    for (int i = 0; i < n; i++) {
        temp += arr[i];
        rst += temp;
    }
 
    printf("%d", rst);
}