#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <algorithm>

 using namespace std;

 const int maxn = +;

 const int INF = <<;

 int p[maxn], t[maxn];

 int main()

 {

     int i, j, T, n;

     double sum, ty, tty;

     double Maxaver, x, Mint;

     while(~scanf("%d", &T))

     {

         while(T--)

         {

             Maxaver = -INF;

             tty = -INF;

             Mint = INF;

             sum = ;

             scanf("%d", &n);

             for(i = ; i <= n; i++)

             scanf("%d", &p[i]);

             for(j = ; j <= n; j++)

             scanf("%d", &t[j]);

             t[n+] = INF;   //初始一个最大值

             for(i = ; i <= n; i++)

             {

                 ty = t[i] - t[i-];

                 if(ty > tty)

                 tty = ty;

                 sum+=p[i];

                 x = sum*1.0/i*1.0;

                 if(x > Maxaver && t[i+]-t[i]>tty)

                 {

                     Mint = tty;

                     Maxaver = x;

                 }

             }

             printf("%.6lf %.6lf\n", Mint, Maxaver);

         }

     }

     return ;

 }