You are given two integer arrays A and B of size N

If at the time i you have array A then you get A; points otherwise you get B; points. The total score is defined as the sum of all points received from time $0$ to time $($N$-1).$

Initially, you have array A but you can exchange array A with B at any time t However if you have array B you cannot exchange it for array A Find the maximum total score you can have,