import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void bAdd(T)(T[] bit, int pos, T val) in { assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold"); } do { for (int x = pos; x < bit.length; x |= x + 1) { bit[x] += val; } } // sum of [0, pos) T bSum(T)(T[] bit, int pos) in { assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold"); } do { T ret = 0; for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) { ret += bit[x]; } return ret; } void main() { try { for (; ; ) { const numCases = readInt; foreach (caseId; 0 .. numCases) { const N = readInt; auto P = new int[N]; foreach (i; 0 .. N) { P[i] = readInt; } auto fs = new int[N]; auto bit = new int[N + 1]; foreach (i; 0 .. N) { fs[i] = bit.bSum(P[i]); bit.bAdd(P[i], +1); } debug { writeln("fs = ", fs); } long cost; auto ans = new int[2 * N]; int l = N, r = N; ans[N] = P[0]; foreach (i; 1 .. N) { cost += min(fs[i], i - fs[i]); if (fs[i] < i - fs[i]) { ans[--l] = P[i]; } else if (fs[i] > i - fs[i]) { ans[++r] = P[i]; } else { ((ans[l] > P[i]) ? ans[--l] : ans[++r]) = P[i]; } } writeln(cost); foreach (i; l .. r + 1) { if (i > l) write(" "); write(ans[i]); } writeln; } } } catch (EOFException e) { } }