Saddle Points

Difficulty: 1300 2000 ms 128 MB

implementation

A cell is a saddle point if it is the minimum of its row and simultaneously the maximum of its column. Count the saddle points.

Input: the first line has N and M; the next N lines each have M integers.

Output: the number of saddle points.

Constraints:

• 1 ≤ N, M ≤ 100
• −10⁴ ≤ values ≤ 10⁴

Sample Tests

3 3
1 2 3
4 5 6
7 8 9

1

2 2
1 1
1 1

4

Read the Editorial