T=int(input())
class Bit:
  def __init__(self, size):
      self.data = [0] * (size + 1)
      self.size = size
  #i: index(0-index)までの和
  def sum(self, i):
      i+=2
      s = 0
      while i > 0:
          s += self.data[i]
          i -= i & -i
      return s

  def add(self, i, x):
      i += 2
      while i <= self.size:
          self.data[i] += x
          i += i & -i

from collections import deque
d=deque()

for _ in range(T):
  N=int(input())
  A=list(map(int, input().split()))
  d=deque()
  bit=Bit(N+10)
  c=0
  for a in A:
    p=bit.sum(a)
    q=bit.sum(N+5)-bit.sum(a)
    c+=min(p,q)
    if p<q:
      d.appendleft(a)
    else:
      d.append(a)
    bit.add(a,1) 
  print(c)
  print(*d)