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.

I don't consider myself a weak problem solver (even been to ACM WF twice), but it's still not obvious for me how does this problem resolve to maximal matching, and how should I convert that matching into result :) So, the problem is worth it.