View Code of Problem 85

#include <iostream>
#include <string>
using namespace std;
int main() {
    int m, n;
    cin >> m >> n;
    int a[m][n], tmpMin;
    int min[m] = {0};
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
            if (j == 0 || a[i][j] < tmpMin) {
                tmpMin = a[i][j];
                min[i] = j;
                continue;
            }
        }
    }
    int tmpMax;
    int max[n] = {0};
    for (int j = 0; j < n; j++) {
        for (int i = 0; i < m; i++) {
            if(i == 0 || a[i][j] > tmpMax){
                tmpMax = a[i][j];
                max[j] = i;
            }
        }
    }
    for(int i = 0; i < m; i++){
        if(max[min[i]] == i)
            cout << i+1 << ' ' << min[i]+1 << endl;
    }
    return 0;
}