for _ in range(int(input())):
n = int(input())
a = sum(list(map(int, input().split())))
b = list(map(int, input().split()))
print(a + sum(b) - max(b))#include<cstdio>
#include<iostream>
#define int long long
using namespace std;
const int N=1e6+10;
int a[N],b[N],st[10][10];
signed main()
{
int T;
cin>>T;
while(T--)
{
int n;
cin>>n;
int sum=0;
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
sum+=a[i];
}
int ma=0;
for(int i=1;i<=n;++i)
{
scanf("%d",&b[i]);
sum+=b[i];
ma=max(ma,b[i]);
}
sum-=ma;
cout<<sum<<'\n';
}
return 0;
}
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |