View Code of Problem 85

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int arr[10000][10000];
int main()
{
	int m, n;
	cin >> m >> n;
	vector<int>v1;
	vector<int>v2;
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> arr[i][j];
		}
	}
	for (int i = 1; i <= m; i++) {
		int minj = -1;
		int min = 1e9;
		for (int j = 1; j <= n; j++) {
			if (arr[i][j] < min) {
				minj = j;
				min = arr[i][j];
			}
		}
		bool flag = true;
		for (int k = 1; k <= m; k++) {
			if (arr[k][minj] > arr[i][minj]) {
				flag = false;
			}
		}
		if (flag) {
			cout << i << " " << minj << endl;
		}
	}
	
	
	return 0;
}