#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

int a[1000], b[1000];

int main()
{
    int T;
    scanf("%d", &T);
    for (int t = 1; t <= T; t++) {
        int K;
        scanf("%d", &K);
        int suma = 0, sumb = 0;
        for (int i = 0; i < K; i++) {
            scanf("%d", &a[i]);
            suma += a[i];
        }
        for (int i = 0; i < K; i++) {
            scanf("%d", &b[i]);
            sumb += b[i];
        }
        int minimum = max(suma, sumb);
        ll maximum = 0;
        for (int i = 0; i < K; i++) {
            for (int j = 0; j < K; j++) {
                maximum += min(a[i], b[j]);
            }
        }
        printf("Minimalni budova obsahuje %d kostek, maximalni %lld kostek.\n", minimum, maximum);
    }
    return 0;
}