Freaks City

We are given an n × m integer matrix. In one operation, we may select a single row and a single column, subtract 1 from every element in that row and every element in that column — except the intersection cell, which is only decremented once (i.e., no double subtraction). Our goal is to minimize the maximum value in the resulting matrix. Key In ...