求助

#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct Edge
{
    int u,v,e;
    ll w;
}edge[110010],edg[1000010];
int n,m,k;
ll c[15],num,ans=0;
int fa[110010];
int find(int x){return fa[x]==x?x:find(fa[x]);}
void merge(int x,int y){fa[find(x)]=find(y);}
bool cmp(Edge x,Edge y){return x.w<y.w;}
int main()
{
    std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>m>>k;
    for(int i=1;i<=m;++i)cin>>edg[i].u>>edg[i].v>>edg[i].w;
    sort(edg+1,edg+1+m,cmp);
    for(int i=1;i<=n;++i)fa[i]=i;
    for(int i=1,j=0;i<=m;++i)
    {
        if(find(edg[i].u)==find(edg[i].v))continue;
        edge[++j]=edg[i];
        edge[j].e=0;
        merge(edg[i].u,edg[i].v);
        ans+=edg[i].w;
    }
    for(int i=1,j=n;i<=k;++i)
    {
        cin>>c[i];
        for(int k=1;k<=n;++k,++j)
        {
            cin>>edge[j].w;
            edge[j].u=n+i;
            edge[j].v=k;
            edge[j].e=i;
        }
    }
    num=n+n*k-1;
    sort(edge+1,edge+1+num,cmp);
    // for(int i=1;i<=num;++i)cout<<edge[i].u<<" "<<edge[i].v<<" "<<edge[i].w<<" "<<edge[i].e<<"\n";
    for(int s=1;s<(1<<k);++s)
    {
        for(int i=1;i<=n+k;++i)fa[i]=i;
        ll res=0,cnt=0;
        for(int i=1;i<=k;++i)
        {
            res+=c[i]*(s&(1<<(i-1)));
            cnt-=(s&(1<<(i-1)));
        }
        for(int i=1;i<=num;++i)
        {
            if(edge[i].e!=0&&(s&(1<<(edge[i].e-1)))==0)continue;
            if(find(edge[i].u)==find(edge[i].v))continue;
            res+=edge[i].w;
            merge(edge[i].u,edge[i].v);
            ++cnt;
            if(res>ans||cnt==n)break;
        }
        ans=min(ans,res);
    }
    cout<<ans;
    return 0;
}