代码如下:
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;
const int maxn=505;
int n,m,n1,t,ans,lasl[maxn],lasr[maxn],g[maxn][maxn],tagl[maxn],tagr[maxn];
bool visl[maxn],visr[maxn];
bool dfs(int x){
visl[x]=1;
for (int i=1;i<=m;i++)
if (!visr[i]){
long long p=tagl[x]+tagr[i]-g[x][i];
if (p==0){
visr[i]=1;
if (lasr[i]==0||dfs(lasr[i])){
lasr[i]=x,lasl[x]=i;
return 1;
}
} else if (p>0) t=min(t,p);
}
return 0;
}
void KM(){
for (int i=1;i<=n;i++)
while (1){
memset(visl,0,sizeof(visl));
memset(visr,0,sizeof(visr));
t=1<<30;
if (dfs(i)) break;
for (int j=1;j<=n;j++) if (visl[j]) tagl[j]-=t;
for (int j=1;j<=m;j++) if (visr[j]) tagr[j]+=t;
}
for (int i=1;i<=m;i++)
ans+=g[lasr[i]][i];
}
int main(){
scanf("%d%d%d",&n,&m,&n1);
int x,y,z;
for (int i=1;i<=n1;i++) scanf("%d%d%d",&x,&y,&z),g[x][y]=z;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (g[i][j]>tagl[i]) tagl[i]=g[i][j];
KM();
printf("%d\n",ans);
return 0;
}