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

#include <atcoder/fenwicktree>
using namespace atcoder;

void solve() {
  int n;
  cin >> n;
  vector<int> P(n);
  for( int i = 0; i < n; i++ ) {
    cin >> P[i];
  }
  long long x = 0;
  deque<int> A;
  fenwick_tree<long long> fw(n);
  for( int i = 0; i < n; i++ ) {
    long long invl = fw.sum(0, P[i]-1);
    long long invr = fw.sum(P[i]-1, n);
    if( A.empty() || invl < invr || ( invl == invr && P[i] < A.front() ) ) {
      A.push_front(P[i]);
      x += invl;
    }else {
      A.push_back(P[i]);
      x += invr;
    }
    fw.add(P[i]-1, 1LL);
  }
  cout << x << "\n";
  for( int i = 0; i < n; i++ ) {
    cout << A[i] << " ";
  }
  cout << "\n";
}

int main() {
  int T;
  cin >> T;
  while(T--) {
    solve();
  }
}