打模板一定要注意!
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 350;
const int INF = 0x7fffffff;
int n, w[N][N], lx[N], ly[N], le[N];
bool S[N], T[N];
void update()
{
int a = INF;
for ( int i = 1; i <= n; ++i ) if ( S[i] )
for ( int j = 1; j <= n; ++j ) if ( !T[j] )
a = min( a, lx[i]+ly[j]-w[i][j] );//fuck
for ( int i = 1; i <= n; ++i ) {
if ( S[i] ) lx[i] -= a;
if ( T[i] ) ly[i] += a;
}
}
bool match( int i )
{
S[i] = true;
for ( int j = 1; j <= n; ++j ) if ( lx[i]+ly[j] == w[i][j] && !T[j] ) {
T[j] = true;
if ( !le[j] || match( le[j] ) ) {
le[j] = i;
return true;
}
}
return false;
}
void KM()
{
for ( int i = 1; i <= n; ++i ) {
le[i] = lx[i] = ly[i] = 0;
for ( int j = 1; j <= n; ++j ) lx[i] = max( lx[i], w[i][j] );
}
for ( int i = 1; i <= n; ++i ) {
while ( 1 ) {
memset( S, 0, sizeof(S));
memset( T, 0, sizeof(T));
if ( match( i ) ) break;
else update();
}
}
}
int main()
{
while (scanf("%d", &n) == 1 ) {
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
scanf("%d", &w[i][j]);
KM();
int ans = 0;
for ( int i = 1; i <= n; ++i ) ans += (lx[i]+ly[i]);
printf("%d\n", ans);
}
}