蓝桥杯基础练习VIP-Huffuman树-题解(C++代码)

#include<iostream>
using namespace std;
void PX(int* a, int n)
{
    int tmp;
    for (int i = 0; i < n - 1; i++)
        for (int j = i + 1; j < n; j++)
            if (a[i] > a[j])
            {
                tmp = a[i];
                a[i] = a[j];
                a[j] = tmp;
            }
}
int main()
{
    int n, a[110];
    int tmp;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    PX(a, n);
    int sum, count = n, sum1 = 0;
    for (int i = 1; i < n; i++)
    {
        count--;
        sum = a[0] + a[1];
        a[0] = sum;
        sum1 = a[0] + sum1;
        for (int j = 1; j < count; j++)
            a[j] = a[j + 1];
        PX(a, count);
    }
    cout << sum1;
    return 0;
}