#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    fenwick_tree<int> ft(n);
    VI df, db;
    ll cost = 0;
    rep(i, n) {
      int p;
      cin >> p;
      p--;
      int cf = ft.sum(0, p), cb = i - cf;
      if (cf < cb) {
        cost += cf;
        df.emplace_back(p);
      } else if (cf > cb) {
        cost += cb;
        db.emplace_back(p);
      } else {
        cost += cf;
        int x = df.empty() ? (db.empty() ? -1 : db[0]) : df.back();
        (p < x ? df : db).emplace_back(p);
      }
      ft.add(p, 1);
    }
    cout << cost << '\n';
    reverse(all(df));
    df.insert(df.end(), all(db));
    rep(i, n) cout << df[i] + 1 << " \n"[i + 1 == n];
  }
}