#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <assert.h>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn = 3e6 + ;

LL a[maxn];

LL b[maxn];

LL tocmpa[maxn];

LL tocmpb[maxn];

int book[maxn];

int pos[maxn];

const int fix = 1e6;

void work() {

    int n;

    scanf("%d", &n);

    for (int i = ; i <= n; ++i) {

        scanf("%lld", &a[i]);

        tocmpa[i] = a[i] + fix;

    }

    for (int i = ; i <= n; ++i) {

        scanf("%lld", &b[i]);

        tocmpb[i] = b[i] + fix;

        pos[tocmpb[i]] = i;

    }

    sort(a + , a +  + n);

    sort(b + , b +  + n, greater<LL>());

    LL ans = ;

    for (int i = ; i <= n; ++i) {

        ans += a[i] * b[i];

    }

    for (int i = ; i <= n; ++i) {

        book[a[i] + fix] = b[i] + fix;

    }

    int anstime = ;

//    for (int i = 1; i <= n; ++i) {

//        printf("%d ", pos[book[tocmpa[i]]]);

//    }

//    printf("\n");

    for (int i = ; i <= n; ++i) {

        if (book[tocmpa[i]] == tocmpb[i]) continue;

        anstime++;

        int wan = book[tocmpa[i]];

        int cur = tocmpb[i];

        int poswan = pos[wan];

        int poscur = pos[cur];

        swap(tocmpb[poswan], tocmpb[poscur]);

        swap(pos[wan], pos[cur]);

    }

    printf("%lld %d\n", ans, anstime);

}

int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    int t;

    scanf("%d", &t);

    while (t--) work();

    return ;

}