SWEA 8338. 계산기 (C++)

#include <stdio.h>

int N, max;
int arr[10];
bool visited[10];

void solve()
{
    max = arr[0];

    for (int i = 1; i < N; i++)
    {
        if (max + arr[i] > max * arr[i])
            max += arr[i];
        else
            max *= arr[i];
    }
}

int main()
{
    int tc = 0;
    scanf("%d", &tc);
    for (int t = 1; t <= tc; t++)
    {
        max = 0;
        scanf("%d", &N);

        for (int i = 0; i < N; i++)
        {
            scanf("%d", &arr[i]);
        }

        solve();

        printf("#%d %d\n", t, max);
    }
    return 0;
}