1 Huffuman树

最新推荐文章于 2024-07-24 14:05:37 发布

万雅过往

最新推荐文章于 2024-07-24 14:05:37 发布

阅读量37

点赞数

分类专栏：东华复试oj 文章标签： c++ 算法 c语言 Powered by 金山文档

本文链接：https://blog.csdn.net/qq_52183449/article/details/129279574

版权

东华复试oj 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

#include <iostream>
using namespace std;
int main(){
    int n;
    int num;
    int sum = 0;//total cost
    cin >> n;
    num = n;
    int* a = new int[n];
    if (n == 1) {
        cin >> a[0];
        cout << a[0] << endl;
    }
    else {
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        while (num>=2) {
            int min1;
            int min_i;
            int min2;
            for (int i = 0; i < n; i++) {
                if (a[i] > 0) {
                    min1 = a[i];
                    min_i = i;
                    break;
                }
            }
            for (int i = 0; i < n; i++) {
                if (a[i] < min1 && a[i]>0) {
                    min1 = a[i];
                    min_i = i;
                }
            }
            a[min_i] = -1;
            for (int i = 0; i < n; i++) {
                if (a[i] > 0) {
                    min2 = a[i];
                    min_i = i;
                    break;
                }
            }
            for (int i = 0; i < n; i++) {
                if (a[i] < min2 && a[i]>0) {
                    min2 = a[i];
                    min_i = i;
                }
            }
            a[min_i] = min1+min2;
            sum += min1;
            sum += min2;
            num--;
        }
        cout << sum << endl;
    }
    return 0;
}