#include <iostream>
#include <algorithm>
#define FOR(i,a,b) for ( int i = int(a); i <= int(b); ++i )
#define FORD(i,a,b) for ( int i = int(a); i >= int(b); --i )
#define REP(i,n) for ( int i = 0; i < int(n); ++i )
using namespace std;

int main( ) {

int row[102];
int col[102];

int M[102][102];

bool usedR[102], usedL[102];

ios::sync_with_stdio( 0 );
  int t,n;
  cin >> t;
  while ( t-- ) {
   unsigned long long top = 0;
    cin >> n;
    for ( int i = 0; i<n; i++)
     cin >> row[i];
    for ( int i = 0; i<n; i++)
      cin >> col[i];

    for ( int i = 0; i<n; i++)
      for ( int j = 0; j<n; j++) {
        M[i][j] = min(row[i], col[j]);
        top += M[i][j];
      }  
   unsigned long long b=0, a = 0;
    for ( int i = 0; i<n; i++)
      a+= row[i];
    for ( int i = 0; i<n; i++)
      b+= col[i];
   unsigned long long low = max(a,b);
   cout << "Minimalni budova obsahuje "<<low<<" kostek, maximalni "<<top << " kostek." << endl;
}


return 0;
}