#include <bits/stdc++.h>
using namespace std;
using ll=long long;

struct segt{
	int sz;
	vector<int> nodes;
	
	segt(int n){
		sz=1;
		while(sz<n)sz*=2;
		nodes.resize(sz*2);
		
	}
	
	void add(int p){
		p+=sz;
		nodes[p]=1;
		while(p>1){
			p>>=1;
			nodes[p]=nodes[2*p]+nodes[2*p+1];
		}
	}
	
	int get(int l,int r){
		l+=sz;
		r+=sz;
		int res=0;
		while(l<r){
			if(l&1)res+=nodes[l++];
			if(r&1)res+=nodes[--r];
			l>>=1;r>>=1;
		}
		return res;
	}
};
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		vector<int> p(n);
		for(int i=0;i<n;i++)cin>>p[i];
		for(int i=0;i<n;i++)p[i]--;
		deque<int> deq;
		segt st(n);
		ll score=0;
		for(int i=0;i<n;i++){
			int t=st.get(0,p[i]);
			if(t<i-t){
				deq.push_front(p[i]+1);
				score+=t;
			}else if(t==i-t){
				if(p[i]<deq.front())deq.push_front(p[i]+1);
				else deq.push_back(p[i]+1);
				score+=t;
			}else{
				deq.push_back(p[i]+1);
				score+=i-t;
			}
			st.add(p[i]);
		}
		cout<<score<<endl;
		for(int i=0;i<n;i++){
			cout<<deq[i];
			if(i<n-1)cout<<" ";
			else cout<<endl;
		}
	}


}