#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lll = __int128;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
template <typename T>
struct BIT{
    int n;
    vector<T> data;
    BIT(int n=0) : n(n), data(n+1){}
    T sum(int i){
        T res = 0;
        for(; i; i -= i&-i){
            res += data[i];
        }
        return res;
    }
    void add(int i, T x){
        for(; i <= n; i += i&-i){
            data[i] += x;
        }
    }
    int lower_bound(T w){
        int x = 0, r = 1;
        while(r<n) r <<= 1;
        for(int l=r;l>0;l>>=1){
            if(x+l<=n && data[x+l]<w){
                x += l;
                w -= data[x];
            }
        }
        return x+1;
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        BIT<int> bit(n);
        ll ans = 0;
        deque<int> que;
        rep(i,n){
            int a;
            cin >> a;
            int l = bit.sum(a), r = i-l;
            if(l<r){
                que.push_front(a);
                ans += l;
            }else if(l>r){
                que.push_back(a);
                ans += r;
            }else{
                if(que.front()>a) que.push_front(a);
                else que.push_back(a);
                ans += l;
            }
            bit.add(a,1);
        }
        cout << ans << '\n';
        rep(i,n){
            cout << que.front() << " ";
            que.pop_front();
        }
        cout << '\n';
    }
    return 0;
}