it is right answer for sample?
input
4
5 8 4 3
3 6 2 1
4 6 4 1
4 3 5 4
my answer
0 0 0 0
5 6 4 4

Funny to say, but once I've read this problem, I remembered
the simplex method we were taught last year.
The classic problem of simplex method is like this:
find min(max)f(X)=C1*X1+C2*x2+c3*x3.. where ci - constants
Also where is a system of conditions:
a11*x1+..<=(>=)b1
a21*x1+..<=(>=)b2 and so on.
The simplex method finds the solution very fast, but it can be a real value, not an integer. There is also a modification of SM called integer SM - it will find an integer solution. Is the problem based on this algo or not?

Hungarian method of weighted matching!
It's interesting that I solved 1449
by first version of program without any optimization.
It,s rather strange because commonly
challange team prepear most difficult tests with respect
to time and memory. Now the problem has junior level.
This is  a pity, because matching frequently using on
various contests.
For information: Let W- weight of maximal matching in A[][]
Graph. Then W- our answer.

Is it reduced to flow or matching ?