[c++]백준 2566번 최댓값

#include #include #include using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int arr[9][9] = {}; int max = 0; int x, y; for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { cin >> arr[i][j]; if (arr[i][j] > max) { max = arr[i][j]; x = i + 1; y = j + 1; } } } cout << max << '\n'; cout << x << " " << y << '\n'; }...