import java.util.Scanner;


public class STAVITEL
{
	static private int[] a = new int[100];
	static private int[] b = new int[100];
	
	public static void main(String[] args)
	{
		Scanner scanner = new Scanner(System.in);
		
		int tcount = scanner.nextInt();
		
		for(int tcase=0; tcase < tcount; tcase++) {
			int k = scanner.nextInt();
			
			for(int i=0; i<k; i++) {
				a[i] = scanner.nextInt();
			}
			for(int i=0; i<k; i++) {
				b[i] = scanner.nextInt();
			}
			
			int maximal = 0;
			
			for(int i=0; i<k; i++) {
				for(int j=0; j<k; j++) {
					maximal += Math.min(a[i], b[j]);
				}
			}
			
			int minimal = 0;
			
			for(int i=0; i<k; i++) {
				for(int j=0; j<k; j++) {
					if(a[i] == b[j]) {
						minimal += a[i];
						a[i] = b[j] = 0;
					}
				}
			}
					
			for(int i=0; i<k; i++) {
				for(int j=0; j<k; j++) {
					minimal += a[i];
					a[i] = 0;
					minimal += b[j];
					b[j] = 0;
				}
			}
			
			System.out.println("Minimalni budova obsahuje "+minimal+" kostek, maximalni "+maximal+" kostek.");
		}
	}
}