#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];
	//int grid[200][200];
	scanf ("%d", &c);
	int s1 = 0;
	int s2 = 0;
	
	while (c--) {
		s1 = 0;
		s2 = 0;
		scanf ("%d", &n);
		for (int i = 0; i < n; i++) {
			scanf ("%d", &front[i]);
			s1 += front[i];
		}
			
		for (int i = 0; i < n; i++) {
			scanf ("%d", &right[i]);
			s2 += 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 minm = max (s1, s2);
		printf ("Minimalni budova obsahuje %d kostek, maximalni %d kostek.\n", minm, maxm);
	}
	return 0;
}