시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 512 MB | 1 | 1 | 1 | 100.000% |
Consider the following game. You have an integer matrix of size $N \times M$. Your task is to put $M$ tokens at some cells of the matrix such as:
The first line of input contains two integers $N$ and $M$ ($1 \le N, M \le 110$). Then matrix $a_i$ comes: $N$ lines, each containing $M$ integers $a_{i,j}$ ($1 \le a_{i,j} \le 10^9$).
Print two integers which describe the placement you found: the minimum possible value of $D_r$ and the minimum value in a matrix cell with a token.
3 3 1 2 3 2 1 2 3 2 1
0 1
3 5 1 2 3 4 5 5 4 3 2 1 4 3 2 1 5
1 2