from collections import deque class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): assert i != 0 s = 0 while i > 0: s += self.tree[i] i -= i & -i return s def add(self, i, x): while i <= self.size: self.tree[i] += x i += i & -i def solve(): n = int(input()) plist = list(map(int, input().split())) deq = deque() bit = Bit(n+10) tento = 0 for i in range(n): p = plist[i] # print(p) if i == 0: deq.append(p) bit.add(p,1) continue low = bit.sum(p) up = i-low # print(p, low, up) if low > up: deq.append(p) tento += up elif low == up: if deq[0] < p: deq.append(p) tento += up else: deq.appendleft(p) tento += low else: deq.appendleft(p) tento += low bit.add(p, 1) # print(deq) print(tento) print(*deq) q = int(input()) while q: q -= 1 solve()