View Code of Problem 85

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int main(){
	int m,n;
	cin>>m>>n;
	int num[m][n];
	for(int i=0;i<m;i++)
		for(int j=0;j<n;j++)
			cin>>num[i][j];
	for(int i=0;i<m;i++){
		int max=0,min=99999;
		int count=0,count2=0;
		for(int j=0;j<n;j++){//找到第i行最小元素 
			if(num[i][j]<min){
				min=num[i][j];
				count=j;
			}
		}
		//cout<<"最小元素"<<count+1<<" ";
		for(int j=0;j<m;j++){//找到最大元素该列的最大元素 
			if(num[j][count]>max){
				max=num[j][count];
				count2=j;
			}
		}
	//	cout<<"最大元素"<<count2+1<<endl;
		if(count2==i)
			printf("%d %d\n",i+1,count+1);
	}
	
	
    return 0;
}