求矩阵数组找鞍点的c＃解法

![img](https://img-mid.csdnimg.cn/release/static/image/mid/ask/145070806766122.png "#left"用c＃怎么解呢，不是很会，数组这块没学懂，求有知道的友解答一下

供参考：

#include <stdio.h>
#define N 10
int main()
{
    int  a[N][N] = { 0 }; 
    int row, col, i, j, k, m = 0, n = 0, max = 0, min = 0, flg = 0;

    scanf("%d", &row);
    col = row;
    for (i = 0; i < row; i++)
        for (j = 0; j < col; j++)
            scanf("%d", &a[i][j]);

    for (i = 0; i < row; i++)
    {
        max = a[i][0];  
        for (j = 0; j < col; j++) 
        {
            if (a[i][j] > max)
            {
                m = j;    //列
                max = a[i][j];
            }
        }
        min = a[0][m];
        for (k = 0; k < row; k++)
        {
            if (a[k][m] < min)
            {
                n = k;  //行
                min = a[k][m];
            }
        }
        if (max == min)
        {
            printf("%d %d", n, m);//输出鞍点
            flg = 1;
        }
    }
    if (!flg)
        printf("NONE");
    return 0;
}