C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2566번:최댓값 답

#include <iostream>
using namespace std;
int main() {
    int arr[9][9];
    int big[3][9] = { 0 };
    int index;
    int max = 0;
    for(int i = 0; i < 9; i++)
        for (int j = 0; j < 9; j++)
        {
            cin >> arr[i][j];
            if (arr[i][j] > big[0][i])
            {
                big[0][i] = arr[i][j];
                big[1][i] = i;//행
                big[2][i] = j;//열]
            }
        }
    for (int i = 0; i < 9; i++)
    {
        if (big[0][i] > max)
        {
            max = big[0][i];
            index = i;
        }
    }
    
    cout << max << '\n';
    cout << big[1][index] + 1 << ' ' << big[2][index] + 1;
}