这个题是km算法板子题(加权二分图最大匹配)
https://blog.csdn.net/chenshibo17/article/details/79933191
不重复造轮子 这里推荐一篇博客 我感觉讲的很不错(这边建议如果不会匈牙利的话先学一下匈牙利比较好理解呢)
贴一个板子
//
// Created by xingchaoyue on 2019/4/12.
//
#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
const int maxn = 310;
const int INF = 0x3f3f3f3f;
int nx,ny;
int g[maxn][maxn];
int linker[maxn],lx[maxn],ly[maxn];
int slack[maxn];
bool visx[maxn];
bool visy[maxn];
bool DFS(int x){
visx[x] = true;
for(int y = 0;y<ny;y++){
if(visy[y])continue;
int tmp = lx[x]+ ly[y]-g[x][y];
if(tmp==0){
visy[y] = true;
if(linker[y]==-1||DFS(linker[y])){
linker[y] = x;
return true;
}
}
else if(slack[y] >tmp){
slack[y]=tmp;
}
}
return false;
}
int km(){
memset(linker,-1,sizeof(linker));
memset(ly,0,sizeof(ly));
for(int i =0;i<nx;++i){
lx[i] = -INF;
for(int j = 0;j<ny;++j){
if(g[i][j]>lx[i])
lx[i] = g[i][j];
}
}
for(int x = 0;x<nx;++x){
for(int i = 0;i<ny;++i){
slack[i] = INF;
}
while(true){
memset(visx,false,sizeof(visx));
memset(visy,false,sizeof(visy));
if(DFS(x))break;
int d = INF;
for(int i =0;i<ny;++i){
if(!visy[i]&&d>slack[i])
d = slack[i];
}
for(int i =0;i<nx;++i){
if(visx[i])
lx[i]-=d;
}
for(int i =0;i<ny;++i){
if(visy[i])ly[i]+=d;
else slack[i]-=d;
}
}
}
int res = 0;
for(int i =0;i<ny;++i){
if(linker[i]!=-1)
res+=g[linker[i]][i];
}
return res;
}
int main(){
int n;
while(scanf("%d",&n)==1){
for(int i = 0;i<n;++i){
for(int j = 0;j<n;++j)
scanf("%d",&g[i][j]);
}
nx = ny = n;
printf("%d\n",km());
}
}