思路:比较显然的求个最大生成树然后10000*(n+m)-权值即可
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 50000+7;
struct Edge
{
int u,v,w;
}e[maxn];
bool cmp(Edge a,Edge b){return a.w>b.w;}
int fa[maxn];
int Find(int x){return fa[x]==x?x:fa[x]=Find(fa[x]);}
int n,m,k;
void init()
{
for(int i = 0;i<=n+m;i++)
fa[i]=i;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&n,&m,&k);
init();
for(int i = 1;i<=k;i++)
{
scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);
e[i].u++;
e[i].v += (n+1);
}
int cnt = 0;
int sum = 0;
sort(e+1,e+1+k,cmp);
for(int i = 1;i<=k;i++)
{
int u = Find(e[i].u);
int v = Find(e[i].v);
if(u!=v)
{
fa[u]=v;
sum+=e[i].w;
if(++cnt>=n+m-1)
break;
}
}
printf("%d\n",10000*(n+m)-sum);
}
}