经典的浮点二分,eps卡时间,不要开的太小
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<unordered_map>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<set>
#include<cstdlib>
#include<stack>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int N = 3e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?a:gcd(b,a%b);}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}
int n,q,m;
// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){
// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }
//
int a[N],b[N];
double pos;
bool check(double mid){
double l,r;
l = -1;
r = 1e15;
for(int i=1;i<=n;i++){
l = max(l,a[i]*1.0+b[i]*1.0-mid);
r = min(r,a[i]*1.0+mid-b[i]*1.0);
}
pos = l;
return l<=r;
}
void solve()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<=n;i++)scanf("%d",&b[i]);
double l = 0.0,r = 2e10;
while(r-l>1e-6){
double mid = (l+r)/2;
if(check(mid)) r = mid;
else l = mid;
//cout<<l<<" "<<r<<"\n";
}
check(r);
//t-->r
//printf("%.6lf\n",r);
printf("%.6lf\n",pos);
}
signed main()
{
//ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _;
cin>>_;
//_ = 1;
while(_--)solve();
return 0;
}