Nathan is preparing for the Dash marathon. He has N training plans. The i-th plan has an effectiveness of A_{i}, but requires that at least B_{i} other training plans must be performed before it. A training plan cannot be repeated.

If he performs some $K > 0 distinct trainings - P_{1}, P_{2}, \ldots , P_{K} (1$ ≤ P_{i} ≤ $N, P_{i} \neq P_{j})$ then his training score is $\frac{\sum_{j=1}^{K} A_{P_{j}}}{K}$. If Nathan does not perform any training plan (K = 0), then his score is 0.

What is the highest score that Nathan can get by performing zero or more training plans, if he can perform them in any order?

------ Input Format ------

• The first line of the input contains a single integer T - the number of test cases. The description of T test cases follows.
• The first line of each test case contains N - the number of training plans.
• The second line contains $N integers A_{1}, A_{2}, \ldots, A_{N}$ where A_{i} is the effectiveness of the i-th training plan.
• The third line contains $N integers B_{1}, B_{2}, \ldots, B_{N}$ where B_{i} is the number of pre-requisite training plans for the i-th training plan.

------ Output Format ------

• For each test case, output a single real number - the highest score that Nathan can get by performing zero or more training plans.
• Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.
  Formally, let your answer be X, and the jury's answer be Y. Your answer is accepted if and only if $\frac{|X - Y|}{\max{(1, |Y|)}}$ ≤ 10^{-6}.

------ Constraints ------

$1 ≤ T ≤ 1000$
$1 ≤ N ≤ 10^{5}$
$-10^{5} ≤ A_{i} ≤ 10^{5}$
$0 ≤ B_{i} ≤ N - 1$
- Sum of $N$ over all test cases does not exceed $5\cdot 10^{5}$.

----- Sample Input 1 ------
3
4
-9 -21 -4 -43
0 0 0 0
5
10 14 5 9 1
4 1 3 0 0
7
-1 101 5 63 -7 -88 59
0 1 6 2 3 4 5

----- Sample Output 1 ------
0.000000
11.500000
54.333333
----- explanation 1 ------
Test case 1: It is optimal for Nathan to not perform any training plans as all the plans have negative $A_{i}$ value.

Test case 2: It is optimal for Nathan to:
- First, perform the $4$-th training plan (for which $B_{i} = 0$).
- Then perform the $2$-nd training plan (for which $B_{i} = 1$ which is satisfied as he has already performed $1$ training plan)

Test case 3: It is optimal for Nathan to:
- First, perform the $1$-st training plan (for which $B_{i} = 0$).
- Then perform the $2$-nd training plan (for which $B_{i} = 1$ which is satisfied as he has already performed $1$ training plan)
- Then perform the $4$-th training plan (for which $B_{i} = 2$ which is satisfied as he has already performed $2$ training plans)

见题面

见题面