View Code of Problem 85

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int m = scanner.nextInt();
		int[][] a = new int[n][m];
		int hang = -1;
		int lie = -1;
		int max = Integer.MIN_VALUE;
		int min = Integer.MAX_VALUE;

		Map map = new HashMap<String, String>();
		boolean first = true;

		for (int i = 0; i < n; i++) {
			min = Integer.MAX_VALUE;
			for (int j = 0; j < m; j++) {
				a[i][j] = scanner.nextInt();
				if (a[i][j] < min) {
					min = a[i][j];
					hang = i + 1;
					lie = j + 1;
				}
			}
			map.put(String.valueOf(hang), String.valueOf(lie));
		}

		for (int j = 0; j < m; j++) {
			max = Integer.MIN_VALUE;
			for (int i = 0; i < n; i++) {
				if (a[i][j] > max) {
					max = a[i][j];
					hang = i + 1;
					lie = j + 1;
				}
			}
			if(map.containsKey(hang+"") && map.get(hang+"").equals(lie+"")) {
				if(first) {
					System.out.print(hang+" "+lie);
				}else {
					System.out.print("\n"+hang+" "+lie);
				}
			}
		}
		
		
		
	}

}