View Code of Problem 85

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int m,n;

    cin >> m >> n;
    int a[m][n];
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
           cin>>a[i][j];
           int min = 0;
           int max = 0;
           int i,j,k;
    for(i = 0; i < m; i++){
        for( j = 0; j < n; j++){
            if(a[i][j] <= a[i][0])
                min = j;
        }
        for( k = 0; k < m;k++){
            if(a[k][min] >= a[i][min])
                max = k;
        }
        if(max == i)
            cout<<max+1<<" "<<min+1<<endl;
    }
    return 0;
}