View Code of Problem 85

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;

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