#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<ctype.h>
#include<string.h>

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<list>
#include <numeric>

using namespace std;

#define FOR(i,a) for(int i=0; i<a; i++)
#define ALL(a) a.begin(), a.end()

typedef long long int64;

int main() {
	int n;
	scanf("%d", &n);
	while (n--)
	{
		int k = 100;
		scanf("%d", &k);


		vector<int64> left(k), right(k);
		for (int i = 0; i < k; ++i)
			scanf("%lld", &left[i]);
			//left[i] = 100000;

		for (int i = 0; i < k; ++i)
			scanf("%lld", &right[i]);
	//right[i] = 100000;

		int64 minn = 0, maxx = 0;
		for (int i = 0; i < k; ++i)
		{
			for (int j = 0; j < k; ++j)
				maxx += min(left[i], right[j]);
		}

		sort(ALL(left));
  	sort(ALL(right));

		for (int i = 0; i < k; ++i)
			minn += max(left[i], right[i]);


//		for (int i = 0; i < k; ++i)
	//		minn += max(left[i], right[i]);
		printf("Minimalni budova obsahuje %lld kostek, maximalni %lld kostek.\n", minn, maxx);

		//printf("-> %lld\n", max(accumulate(ALL(left), 0LL), accumulate(ALL(right), 0LL)));
	}
	return 0;
}