For this Question: Given a 2*N matrix in which each cell contains some candies in it. You are at the top left corner of the matrix and want to reach the bottom right corner of the matrix i. e from (1, 1) to (2, N). You can only move right or down. You have to find the maximum number of candies you can collect in your journey.The first line of input contains a single integer N. The second line of input contains N spaces separated integers. The last line of input contains N space-separated integers.

<b>Constraints:-</b>
2 <= N <= 10000
1 <= Matrix[i][j] <= 100000Print the maximum amount of candies you can have at the end of your journey.Sample Input 1:-
5
1 3 5 6 2
2 4 8 4 2

Sample Output 1:-
23

Sample Input 2:-
4
1 1 1 1
1 1 1 1

Sample Output 2:-
5, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long

signed main(){

int n;
cin>>n;
int a[n][2];
for(int i=0;i<n;i++){
    cin>>a[i][0];
}
for(int i=0;i<n;i++){
    cin>>a[i][1];
}
for(int i=1;i<n;i++){
    a[i][0]+=a[i-1][0];
}
for(int i = n-2;i>=0;i--){
    a[i][1]+=a[i+1][1];
}
int ans=0;
for(int i=0;i<n;i++){
    ans=max(a[i][0]+a[i][1],ans);
}
cout<<ans;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?