import sys
input = sys.stdin.readline

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x

    def __str__(self):
        temp = []
        for i in range(self._n):
            temp.append(str(self.sum(i, i + 1)))
        return ' '.join(temp)


from collections import *
Q = int(input())
for _ in range(Q):
    N = int(input())
    T = Fenwick_Tree(N)
    P = list(map(int, input().split()))
    ans = deque()
    v = 0
    for i in range(N):
        p = P[i] - 1
        L = T.sum(0, p)
        R = T.sum(p+1, N)
        if L < R:
            ans.appendleft(p+1)
            v += L
        elif L > R:
            ans.append(p+1)
            v += R
        elif len(ans) == 0:
            ans.append(p+1)
            v += L
        elif ans[0]-1 < p:
            ans.append(p+1)
            v += L
        else:
            ans.appendleft(p+1)
            v += L
        T.add(p, 1)
    print(v)
    print(*ans)