新的开始（最小生成树）

原题链接

解题思路：先建立超级源点，然后求一遍最小生成树即可

C++代码

#include <bits/stdc++.h>
using namespace std;
const int N = 310, M = N * (N);
int n, idx, p[N];
struct Edge
{
    int a, b, w;
    bool operator< (const Edge& W) const 
    {
        return w < W.w;
    }
}e[M];

int find(int x)  // 并查集
{
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}


int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
    {
        int v;
        cin >> v;
        e[idx ++ ] = {0, i, v};
    }
    for (int i = 1; i <= n; i ++ )
    {
        for (int j = 1; j <= n; j ++ )
        {
            int v;
            cin >> v;
            e[idx ++ ] = {i, j, v};
        }
    }
    sort(e, e + idx);
    for (int i = 0; i <= n; i ++ ) p[i] = i;
    int res = 0;
    for (int i = 0; i < idx; i ++ )
    {
        int pa = find(e[i].a), pb = find(e[i].b);
        if (pa != pb) 
        {
            p[pa] = pb;
            res += e[i].w;
        }
    }
    cout << res << endl;
    return 0;
}