宣贯求条RE

#include<bits/stdc++.h>
#define int long long
#define mk make_pair
#define pr pair<long long,pair<long long,long long> >
#define prr pair<pair<long long,long long>,pair<long long,long long> > //w h u v
using namespace std;
int n,m,k,ans;
vector<pr> e;
vector<prr> use;
int c[12];
int fa[10015];
bool f[12];

int find(int x){
	if(fa[x]==x){
		return x;
	}
	return fa[x]=find(fa[x]);
}

int kru(int t,bool op,int s){
	int cnt=0,sum=0;
	for(int i=1;i<=n+k;i++){
		fa[i]=i;
	}
	for(int i=1;i<=k;i++){
		if(f[i]){
			sum+=c[i];
		}
	}
	for(int i=0;i<t&&cnt<n+s-1;i++){
		int u=find(e[i].second.first);
		int v=find(e[i].second.second);
		if(u!=v){
			if(op){
				use.push_back(mk(mk(e[i].first,0),mk(e[i].second.first,e[i].second.second)));
				cnt++;
				fa[u]=v;
			}
			else{
				cout<<use[i].first.second<<"\n";
				if(f[use[i].first.second]){
					sum+=use[i].first.first;
					cnt++;
					fa[u]=v;
				}
				cout<<"A";
			}
		}
	}
	return sum;
}

void choose(int now,int cnt){
	if(now>k){
		ans=max(ans,kru(use.size(),false,cnt));
		return;
	}
	choose(now+1,cnt);
	f[now]=1;
	choose(now+1,cnt+1);
	f[now]=0;
}

signed main(){
	f[0]=1;
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		e.push_back(mk(w,mk(u,v)) ) ;
	}
	sort(e.begin(),e.end());
	kru(m,1,0);
	for(int i=1;i<=k;i++){
		cin>>c[i];
		for(int j=1;j<=n;j++){
			int a;
			cin>>a;
			use.push_back(mk(mk(a,i),mk(n+i,j)));
		}
	}
	sort(use.begin(),use.end());
//	for(int i=0;i<use.size();i++){
//		cout<<use[i].first.first<<' '<<use[i].first.second<<' '<<use[i].second.first<<' '<<use[i].second.second<<'\n';
//	}
	
	choose(1,0);
	cout<<ans;
	return 0;
}