-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathB.cpp
72 lines (58 loc) · 1.08 KB
/
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
Author: saiyan_01
Problem Statement :
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define e "\n"
#define len(x) x.size()
#define gcd(a, b) __gcd(a, b)
#define ste(v) v.begin(), v.end()
#define stea(arr, n) arr, arr+n
void solve(){
// Solve here
int n;
cin>>n;
int arr1[n];
for(int i=0;i<n;i++) {
if(i==0) cin>>arr1[i];
else {
int x;
cin>>x;
arr1[i] = x+arr1[i-1];
}
}
int m;
cin>>m;
int arr2[m];
for(int i=0;i<m;i++) {
if(i==0) cin>>arr2[i];
else {
int x;
cin>>x;
arr2[i] = x+arr2[i-1];
}
}
sort(arr1, arr1+n);
sort(arr2, arr2+m);
cout<<max(0,max(arr1[n-1]+arr2[m-1], max(arr1[n-1], arr2[m-1])))<<e;
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}