#include <stdio.h>
#include <iostream>
#include <vector>

using namespace std;

int main(void)
{
	int cases;
	cin >> cases;

	for (int i = 0; i < cases; i++) {
		int k;
		cin >> k;
		vector<int> v1, v2, v3;
		for (int j = 0; j < k; j++) {
			int tmp;
			cin >> tmp;
			v1.push_back(tmp);
		}
		for (int j = 0; j < k; j++) {
			int tmp;
			cin >> tmp;
			v2.push_back(tmp);
			v3.push_back(tmp);
		}

		int l = 0, m = 0;
		// iterace jedna
		for (int j = 0; j < k; j++) {
			if (v1[j] == 0) continue;
			bool found = false;
			for (int h = 0; h < k; h++) {
				//if (v1[j] <= v2[h]) m += v1[j];
				if (v1[j] <= v3[h]) {
					m += v1[j];
					//printf("%d ", v1[j]);
				} else {
					m += v3[h];
					//printf("%d ", v3[h]);
				}
				if (!found && v1[j] == v2[h]) {
					l += v1[j];
					v2[h] = 0;
					found = true;
				}
			}
			if (!found) l += v1[j];
//printf("\n");
		}
		// iterace dve
		for (int j = 0; j < k; j++) {
			if (v2[j] > 0) l += v2[j];
		}
		cout << "Minimalni budova obsahuje " << l << " kostek, maximalni " << m << " kostek." << endl;
	}

	return 0;
}