import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int TC = sc.nextInt();
for(int testCase=0; testCase<TC; testCase++){
int N = sc.nextInt();
int[] M = new int[N];
int[] E = new int[N];

for(int i=0; i<N; i++){
            M[i] = sc.nextInt();
        }
        for(int i=0; i<N; i++){
            E[i] = sc.nextInt();
        }
        for(int j=0; j<N; j++)
        {
            int max = E[j];
            int index_m = j;
            for(int i=j+1; i<N; i++)
            {
                if(max < E[i])
                {
                    int tmp = max;
                    E[index_m] = E[i];
                    E[i] = tmp;

                    tmp = M[index_m];
                    M[index_m] = M[i];
                    M[i] = tmp;
                }
                else if(max == E[i]){
                    if(M[index_m]>M[i]){
                        int tmp = M[index_m];
                        M[index_m] = M[i];
                        M[i] = tmp;
                    }

                }
            }
        }

        int end = 0;
        int start = 0;
        for(int i=0; i<N; i++){
            start += M[i];
            end = Math.max(end, start+E[i]);    
        }
        System.out.println(end);
    }}

}