#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#include <iomanip>
#include <array>
using namespace std;
using ll = long long;
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto &it : a) {
cin >> it;
}
for (auto &it : b) {
cin >> it;
}
int cnt = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(b[i] - a[i], ans);
ans = max(0, ans);
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--)
solve();
}
Copy