7.找出矩阵中行最大列最小的数

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define M 3
#define N 4
void fun(int(*a)
)
{
int i = 0, j, find = 0, rmax, c, k;
while ((i < M) && (!find))
{
rmax = a[i][0];
c = 0;
for (j = 0;j < N;j++)
if (rmax < a[i][j])
{
rmax = a[i][j];
c = j;
}
find = 1;
k = 0;
while (k < M&&find)
{
if (k != i&&a[k][c] <= rmax)
find = 0;
k++;
}
if (find)
printf("find:a[%d][%d]=%d\n", i, c, a[i][c]);
i++;
}
if (!find)
printf("No found!\n");
}
int main()
{
int x[M]
, i, j;
printf("Enter number for array:\n");
for (i = 0;i < M;i++)
for (j = 0;j < N;j++)
scanf("%d", &x[i][j]);
printf("The array:\n");
for (i = 0;i < M;i++)
{
for (j = 0;j < N;j++)
printf("%3d", x[i][j]);
printf("\n\n");
}
fun(x);
getchar();
getchar();
return 0;

}