#include <stdio.h>
#include <stdlib.h>

int min_n(int a, int b){
	return (a>b)?b:a;
}

int max_n(int a, int b){
	return (a>b)?a:b;
}

int main(){
	int t_c, i, max, k, j, r_sum, d_sum;
	int *right, *down;
	scanf("%d", &t_c);
	while(t_c!= 0){
		max = 0;
		r_sum = 0;
		d_sum = 0;
		scanf("%d", &k);
		right = malloc(sizeof(int)*k);
		down = malloc(sizeof(int)*k);
		for (i=0; i < k; i++){
			scanf("%d", &right[i]);
		}
		for (i=0; i < k; i++){
			scanf("%d", &down[i]);
		}

		for (i=0; i < k;i++){
			for (j = 0; j < k; j++){
				max+=min_n(right[i], down[j]);
			}
			r_sum+=right[i];
			d_sum+=down[i];
		}
		printf("Minimalni budova obsahuje %d kostek, maximalni %d kostek.\n", max_n(r_sum, d_sum), max);
		free(right);
		free(down);
		t_c--;
	}
	return 0;
}