#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using S = long long;
S op(S a, S b){
	return a + b;
}
S e(){
	return 0;
}

void solve(){
	int n;
	cin >> n;
	vector<int> p(n);
	cin >> p;
	rep(i, n) p[i]--;
	segtree<S, op, e> seg(n);
	long long ans = 0;
	deque<int> d;
	rep(i, n){
		int x = p[i];
		int left = seg.prod(0, x);
		int right = seg.prod(x + 1, n);
		if(left < right){
			ans += left;
			d.push_front(x);
		}else{
			ans += right;
			d.push_back(x);
		}
		seg.set(x, 1);
	}
	cout << ans << "\n";
	for(auto x : d){
		cout << x + 1 << ' ';
	}
	cout << "\n";
}

int main(){
	int t;
	cin >> t;
	rep(_, t) solve();
	return 0;
}