[BOJ/C++] 2566 최댓값

최댓값을 2차원에서 찾는 문제

#include <iostream>
#include <vector>
#include <limits.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	vector<vector<int>> ans;
	int MAX = INT_MIN;
	int x, y;
	for (int i = 0; i < 9; i++) {
		vector<int> a;
		int input;
		for (int j = 0; j < 9; j++) {
			cin >> input;
			if (input > MAX) {
				MAX = input;
				x = i + 1;
				y = j + 1;
			}
		}
	}
	cout << MAX << "\n";
	cout << x << " " << y;
	return 0;
}