#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using mint = atcoder::modint998244353;

void solve(){
	int n;
	cin>>n;
	vector<int> p(n);
	rep(i,n) cin>>p.at(i);
	rep(i,n) p.at(i)--;
	atcoder::fenwick_tree<int> fw(n);
	deque<int> ans;
	ans.push_back(p.at(0));
	fw.add(p.at(0),1);
	ll res=0;
	for(int i=1;i<n;i++){
		int btt=fw.sum(p.at(i),n);
		int ftt=i-btt;
		if(ftt==btt){
			if(ans.front()<p.at(i)) ans.push_back(p.at(i));
			else ans.push_front(p.at(i));
		}else if(ftt<btt){
			ans.push_front(p.at(i));
		}else{
			ans.push_back(p.at(i));
		}
		res+=min(ftt,btt);
		fw.add(p.at(i),1);
	}
	cout<<res<<"\n";
	for(auto x:ans){
		cout<<x+1<<" ";
	}
	cout<<"\n";
}

int main(){
	int t;
	cin>>t;
	rep(i,t) solve();
}