#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

template<typename T>
struct BIT{
private:
  vector<T> A;
  const int n;
  
public:
  BIT(int _n) : A(_n+1,0), n(_n){}
  
  T sum(int i){
    T s=0;
    while(i>0){
      s+=A[i];
      i-=i&-i;
    }
    return s;
  }
  
  T sum(int i,int j){
    return sum(j)-sum(i-1);
  }
  
  void add(int i,T x){
    while(i<=n){
      A[i]+=x;
      i+=i&-i;
    }
  }

  void update(int i,T x){
    T tmp=sum(i,i);
    if(tmp!=x) add(i,x-tmp);
  }
};
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int t;
  cin>>t;
  while(t--){
    int n;
    cin>>n;
    vector<int> P(n);
    rep(i,n) cin>>P[i];
    BIT<ll> bit(n);
    deque<int> deq;
    deq.push_back(P[0]);
    bit.add(P[0],1);
    ll sum=0;
    for(int i=1;i<n;i++){
      ll l=bit.sum(1,P[i]);
      ll r=bit.sum(P[i],n);
      if(l<r) deq.push_front(P[i]);
      else if(l>r) deq.push_back(P[i]);
      else if(deq.front()<P[i]) deq.push_back(P[i]);
      else deq.push_front(P[i]);
      bit.add(P[i],1);
      sum+=min(l,r);
    }
    vector<int> ANS;
    for(auto x:deq) ANS.push_back(x);
    cout<<sum<<'\n';
    rep(i,n){
      if(i) cout<<" ";
      cout<<ANS[i];
    }
    cout<<'\n';
  }
    
  return 0;
}