1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 
 6 using namespace std;
 7 
 8 #define N 330
 9 #define INF 0xfffffff
10 
11 int n, s[N];
12 int lx[N], ly[N], maps[N][N], used[N], visx[N], visy[N];
13 
14 int found(int u)
15 {
16     visx[u] = true;
17     for(int i = 1; i <= n; i++)
18     {
19         if(!visy[i] && lx[u] + ly[i] == maps[u][i])
20         {
21             visy[i] = 1;
22             if(!used[i] || found(used[i]))
23             {
24                 used[i] = u;
25                 return true;
26             }
27         }
28         else
29             s[i] = min(s[i], lx[u]+ly[i]-maps[u][i]);
30     }
31     return false;
32 }
33 
34 int KM()
35 {
36     memset(used, 0, sizeof(used));
37     memset(lx, 0, sizeof(lx));
38     memset(ly, 0, sizeof(ly));
39 
40     for(int i = 1; i <= n; i++)
41         for(int j = 1; j <= n; j++)
42         lx[i] = max(lx[i], maps[i][j]);   // 每个lx存的是可以的最大值，ly是0，相加就是自己所投的资金最大值。
43     for(int i = 1; i <= n; i++)
44     {
45         for(int j = 1; j <= n; j++)
46             s[j] = INF;
47         while(1)
48         {
49             memset(visx, 0, sizeof(visx));
50             memset(visy, 0, sizeof(visy));
51 
52             if(found(i)) 
53                 break;
54             int d = INF;
55             for(int j = 1; j <= n; j++)
56                 if(!visy[j])
57                     d = min(d, s[j]);   // 如果找不到最大值匹配，就找需要减得最小值，让该匹配的减去最小值完成最大匹配
58             for(int j = 1; j <= n; j++)
59             {
60                 if(visx[j])
61                     lx[j] -= d;
62                 if(visy[j])
63                     ly[j] += d;
64             }
65         }
66     }
67     int ans = 0;
68     for(int i = 1; i <= n; i++)
69         ans += maps[used[i]][i];
70     return ans;
71 }
72 
73 int main()
74 {
75     while(~scanf("%d", &n))
76     {
77         for(int i = 1; i <= n; i++)
78         {
79             for(int j = 1; j <= n; j++)
80             {
81                 scanf("%d", &maps[i][j]);
82             }
83         }
84         printf("%d\n", KM());
85     }
86     return 0;
87 }