1 // question: Find the "saddle point" of a two-dimensional array, that is, the element at this position is the largest on the row and the smallest on the column. Or there may be no saddle points. 2 // 3 # include "stdio. h "4 # include <stdlib. h> 5 int main () 6 {7 int I, j, k, hang = 1, lie = 1; 8 printf ("input row "); 9 scanf ("% d", & hang); 10 printf ("input column"); 11 scanf ("% d", & lie ); 12 printf ("Enter the elements of the matrix, input the elements from left to right in the row, input the elements from top to bottom between lines, and input the elements by pressing enter: \ n "); 13 int zong = hang * lie; 14 15 int * a; 16 a = (int *) malloc (zong * sizeof (int )); 17 printf ("Enter % d elements:", zong); 18 for (I = 0; I <zong; I ++) 19 scanf ("% d ", & a [I]); 20 printf ("\ B \ n "); 21 22 int ** data; 23 24 25 data = (int **) malloc (hang * sizeof (int *); 26 for (int j = 0; j