View Code of Problem 85

#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
int main(){
   int n,m,min=0,max=0;
   scanf("%d%d",&m,&n);
   int matrix[m][n];
   for(int j=0;j<m;j++)
		for(int k=0;k<n;k++)
			scanf("%d",&matrix[j][k]);

		for(int j=0;j<m;j++){

			for(int k=0;k<n;k++){
				if(matrix[j][k]<matrix[j][min])
					min=k;
				if(matrix[j][k]>matrix[max][k])
					max=j;
			}
		}
		printf("%d %d\n",max+1,min+1);
	return 0;
}

Double click to view unformatted code.


Back to problem 85