View Code of Problem 85

#include<bits/stdc++.h>
using namespace std;

int main() {
	int m,n,arr[100][100],min,max,index1,index2,index3;
	cin>>m>>n;
	for(int i=0; i<m; i++) {
		for(int j=0; j<n; j++) cin>>arr[i][j];
	}
	for(int i=0; i<m; i++) {
		//行中最小
		min=arr[i][0];
		index1=i;
		index2=0;
		for(int j=0; j<n; j++) {
			if(min>arr[i][j]) {
				min=arr[i][j];
				index2=j;	
			}
		}
		//列中最大
		max=arr[0][index2];
		for(int k=0; k<n; k++) {
			if(max<arr[k][index2]) {
				max=arr[k][index2];
				index3=k;
			}
		}
		if(index3==index1) cout<<index1+1<<" "<<index2+1<<endl;
	}
}