问题 P: 哈夫曼树

 

#include<bits/stdc++.h>
int val[100];
int cmp(const void* a, const void* b)
{
    return *(int*)a - *(int*)b;
}
int main()
{
    int n, i, ans;
    while (scanf("%d", &n) != EOF)
    {
        ans = 0;
        for (i = 0; i < n; i++) scanf("%d", &val[i]);
        for (i = 1; i < n; i++)
        {
            qsort(&val[i - 1], n - i + 1, sizeof(val[0]), cmp);
            ans += val[i - 1] + val[i];
            val[i] += val[i - 1];
        }
        printf("%d\n", ans);
    }
    return 0;
}