-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathB.cpp
36 lines (32 loc) · 844 Bytes
/
B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb push_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 100+5;
int n,m,r[MAXN],b[MAXN];
inline void Solve(){
scanf("%d",&n);
FOR(i,1,n) scanf("%d",r+i),r[i] += r[i-1];
scanf("%d",&m);
FOR(i,1,m) scanf("%d",b+i),b[i] += b[i-1];
int ans = 0;
FOR(i,0,n) FOR(j,0,m) ans = std::max(ans,r[i]+b[j]);
printf("%d\n",ans);
}
int main(){
int T;scanf("%d",&T);
while(T--) Solve();
return 0;
}