View Code of Problem 85

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
int main()
{
    int col;
    int row;
    scanf("%d %d",&col,&row);
    int **arr = malloc(sizeof(int *)*col);
    for(int i = 0;i<col;i++){
        arr[i] = (int *)malloc(sizeof(int) * row);
        for(int j = 0;j<row;j++){
            scanf("%d",&arr[i][j]);
        }
    }
    int min = 0;
    int max = 0;
    for(int i = 0;i<col;i++){
        min = 0;//(0,0)->(0,min)
        for(int j = 1;j<row;j++){
            if(arr[i][min] > arr[i][j]){
                min = j;
            }
        }
        max = 0;//(3,1)//(max,min);
        for(int j = 1;j<col;j++){
            if(arr[j][min]>arr[max][min]){
                max = j;
            }
        }
        if(i == max){
            printf("%d %d\n",max+1,min+1);
        }
    }
	return 0;
}