#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>

using namespace std;

int main() {
	int c, n;
	int front[200];
	int right[200];
	scanf ("%d", &c);

	while (c--) {
		scanf ("%d", &n);
		for (int i = 0; i < n; i++)
			scanf ("%d", &front[i]);
			
		for (int i = 0; i < n; i++)
			scanf ("%d", &right[i]);
			
		int maxm = 0;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				maxm += min (front[i], right[j]);
		

		int sum = 0;
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < n; j++) {
				if (front[i] == right[j]) {
					sum += front[i];
					right[j] = 0;
					front[i] = 0;
					break;
				}
			}
		}
		
		for (int i = 0; i < n; i++) 
			sum += front[i];
			
		for (int i = 0; i < n; i++) 
			sum += right[i];
			
		printf ("Minimalni budova obsahuje %d kostek, maximalni %d kostek.\n", sum, maxm);	
			/*
			for (int j = 0; j < n; j++) {
				if (used[j] == false && (front[i] == right[j])) {
					grid[i][j] = front[i];
					used[j] =
					goto next;
				}
				
			}*/
			
	}
	return 0;
}