注意vector儲存的記憶體地址可能會變，所以如果用vector來儲存所有節點的話，需要先resize好容器，保證期間不進行節點的增減。multiset是允許關鍵字重複的容器

#include<vector>
#include<iostream>
#include<string>
#include<set>
using namespace std;
struct node {
    string data;
    int w;//權值或概率
    string ma;
    node *l, *r;
    int flag;
    node() { l = r = NULL;ma = ""
 
;flag = 0; }
    bool operator<(const node b) const {
        return w < b.w;
    }
};
multiset<node> all;
vector<node> resault;//最終的所有節點
int N;

void dfs(node *&root)//赫爾曼編碼
{
    if (root->l) {
        root->l->ma = root->ma + "0";dfs(root->l);
    }
    if (root->r) {
        root->r->ma = root->ma + "1"
 
;dfs(root->r);
    }
}

int main()
{
    int cnt = 0;
    cout << "請輸入節點的個數" << endl;
    cin >> N;
    resault.resize(2 * N - 1);
    cout<<"請依次輸入各節點的名字和權值"<<endl;
    while (N--)
    {
        node tem;
        cin >> tem.data >> tem.w;
        tem.flag = 1
 
;
        all.insert(tem);
    }
    while (all.size() != 1)//選2個最小的到resault中，並建立一個最小合併的節點到all
    {
        node tem;
        auto it2 = all.begin(), it = all.begin();
        it2++;
        resault[cnt++] = *it;
        resault[cnt++] = *it2;
        tem.l = &resault[cnt - 2];tem.r = &resault[cnt - 1];
        tem.data = "(" + tem.l->data + "+" + tem.r->data + ")";
        tem.w = tem.l->w + tem.r->w;
        it2++;
        all.erase(it, it2);
        all.insert(tem);
        /*for (auto x : all)
        cout << x.data << " ";
        cout << endl;*/
    }
    resault[cnt++] = *all.begin();
    //遍歷，求所求//比如赫爾曼碼
    node *root = &resault[resault.size() - 1];
    dfs(root);
    for (auto x : resault)
        if (x.flag == 1) cout << x.data << " " << x.ma << endl;

}