import java.util.Scanner;



/**
 *
 * @author cteam045
 */
public class Stavitel {

    private static int maximum(int[] front, int[] side){
        int soucet = 0;        
        for (int i = 0; i < front.length; i++){
            for (int j = 0; j < front.length; j++){
                soucet += Math.min(front[i], side[j]);
            }
        }
        return soucet;
    }
    
    private static int minimum(int[] front, int[] side){
        boolean[] sideUsed = new boolean[side.length];
        int soucet = 0;
        main:for (int i = 0; i < front.length; i++){
            if (front[i] == 0){
                continue;
            }
            for (int j = 0; j < front.length; j++){
                if (front[i] > side[j]){
                    continue;
                }
                if (front[i] == side[j] && !sideUsed[j]){
                    sideUsed[j] = true;
                    soucet += front[i];
                    continue main;
                }
            }
            soucet += front[i];

        }
        for (int i = 0; i < side.length; i++){
            if (!sideUsed[i]){
                soucet += side[i];
            }
        }
        return soucet;
    }
    
    private static void solve(int[] front, int[] side){
        int max = maximum(front, side);
//        int tmp1 = 0;
//        int tmp2 = 0;
//        for (int i = 0; i < front.length; i++){
//            tmp1 += front[i];
//            tmp2 += side[i];
//        }
//        int min = Math.max(tmp1, tmp2);
        int min = minimum(front, side);
        System.out.printf("Minimalni budova obsahuje %d kostek, maximalni %d kostek.\n", min, max);
    }
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int pocetPripadu = sc.nextInt();
        for (int i = 0; i < pocetPripadu; i++){
            int velikost = sc.nextInt();
            int[] front = new int[velikost];
            int[] side = new int[velikost];
            for (int j = 0; j < velikost; j++){
                front[j] = sc.nextInt();
            }
            for (int j = 0; j < velikost; j++){
                side[j] = sc.nextInt();
            }
            solve(front, side);
        }
    }
}