#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<queue>#include<math.h>const int N=1111;using namespace std;struct str{int w;double ave;str(){w=0;ave=0;}};double abs(){}bool cmp(const str &a,const str &b){if(fabs(a.ave-b.ave)<0.000001)return a.w<b.w;return a.ave>b.ave;}int main(){ char s[22][22],ans[20]; bool vis[1112]; int n,i,j,k,x; int cas; int p[1111]; int sum[1111],t[1111],c[1111]; cin>>cas;while(cas--){ str a[1111]; cin>>n; sum[0]=0;p[0]=c[0]=t[0]=0; for(i=1;i<=n;i++){ cin>>p[i]; sum[i]=sum[i-1]+p[i]; } for(i=1;i<=n;i++){ scanf("%d",t+i); c[i]=max(c[i-1],t[i]-t[i-1]); } c[n+1]=c[n]+1; for(i=1;i<=n;i++){ while(c[i]==c[i+1])i++; a[i].w=c[i]; a[i].ave=1.0*sum[i]/i; } sort(a+1,a+n+1,cmp); printf("%.6lf %.6lfn",1.0*a[1].w,a[1].ave);} return 0;}
