#include <bits/stdc++.h>
using namespace std;

using SS = long long;
class SegmentTree{
    public:
    int siz = 1;
    vector<SS> dat;
 
    SS op(SS a, SS b){return a+b;}
    SS e(){return 0;}
    void renew (SS &a,SS x){
        //a = op(a,x);
        a = x;
        //その他.
    }
 
    void make(int N){
        while(siz < N) siz *= 2;
        dat.resize(siz*2,e());
    }
 
    void make2(int N,vector<SS> &A){
        make(N);
        for(int i=0; i<N; i++){
            int pos = i+siz;
            dat.at(pos) = A.at(i);
        }
        for(int i=siz-1; i>0; i--) dat.at(i) = op(dat.at(i*2),dat.at(i*2+1));
    }
 
    void update(int pos,SS x){
        pos = pos+siz;
        renew(dat.at(pos),x);
        while(pos != 1){
            pos = pos/2;
            dat.at(pos) = op(dat.at(pos*2),dat.at(pos*2+1));
        }
    }
 
    SS findans(int l, int r){
        SS ret = e();
        l += siz,r += siz;
        while(l < r){
            if(l&1) ret = op(ret,dat.at(l++));
            if(r&1) ret = op(ret,dat.at(--r));
            l >>= 1; r >>= 1;
        }
        return ret;
    }
 
    SS get(int pos){return dat.at(pos+siz);}
    SS rangeans(int l, int r){return findans(l,r);}
    SS allrange(){return findans(0,siz);}
 
    //ノーマルセグ木 二分探索は実装してない.
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--){
        int N; cin >> N;
        long long answer = 0;
        SegmentTree Z; Z.make(N);

        int a1; cin >> a1; a1--;
        deque<int> Q; Q.push_back(a1);
        Z.update(a1,1);
        for(int i=1; i<N; i++){
            int a; cin >> a; a--;
            int fr = Z.rangeans(0,a),ba = Z.rangeans(a,N);
            if(fr >= ba) answer += ba,Q.push_back(a);
            else answer += fr,Q.push_front(a);
            Z.update(a,1);
        }
        
        cout << answer << endl;
        for(int i=0; i<N; i++){
            if(i) cout << " ";
            cout << Q.front()+1;
            Q.pop_front();
        }
        cout << endl;
        
    }
}