#include <iostream>
#include <deque>
#include <atcoder/fenwicktree>
using namespace std;
using namespace atcoder;
typedef long long ll;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        int p[200005];
        for (int i = 0; i < n; i++)
        {
            cin >> p[i];
            p[i]--;
        }
        deque<int> deq;
        fenwick_tree<int> bit(n);
        ll ans = 0;
        for (int i = 0; i < n; i++)
        {
            if (bit.sum(0, p[i]) < bit.sum(p[i], n))
            {
                deq.push_front(p[i]);
            }
            else
            {
                deq.push_back(p[i]);
            }
            ans += min(bit.sum(0, p[i]), bit.sum(p[i], n));
            bit.add(p[i], 1);
        }
        cout << ans << endl;
        while (deq.size())
        {
            cout << deq.front() + 1 << " ";
            deq.pop_front();
        }
        cout << endl;
    }
}