蒟蒻求助

#include<bits/stdc++.h>
#define int long long
using namespace std;
struct edge
{
	int u,v,w;
	bool operator<(const edge &x)const{
		return w>x.w;
	}
};
int n,m,k,fa[20000],a[11][10001],ans;
int find(int x)
{
	if(x==fa[x]) return x;
	return fa[x]=find(fa[x]);
}
int solve(priority_queue<edge> &q,int cnt)
{
	priority_queue<edge> t;
	int res=0;
	for(int i=1;i<=n+k;i++) fa[i]=i;
	while(cnt)
	{
		edge x=q.top();q.pop();
		if(find(x.u)==find(x.v)) continue;
		t.push(x);
		fa[fa[x.u]]=fa[x.v];
		res+=x.w;
		cnt--;
	}
	q=t;
	return res;
}
void dfs(int p,priority_queue<edge> q,int cnt,int now)
{
	if(p==k+1)
	{
		if(ans>now) ans=now;
		return;
	}
	dfs(p+1,q,cnt,now);
	for(int i=1;i<=n;i++) q.push((edge){i,n+p,a[p][i]});
	int noww=solve(q,cnt+1);
	dfs(p+1,q,cnt+1,noww+a[p][0]);
}
signed main()
{
	priority_queue<edge> q;
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m>>k;
	for(int i=1,u,v,w;i<=m;i++) cin>>u>>v>>w,q.push((edge){u,v,w});
	for(int i=1;i<=k;i++) for(int j=0;j<=n;j++) cin>>a[i][j];
	ans=solve(q,n-1);
	dfs(1,q,n-1,ans);
	cout<<ans;
	return 0;
}