#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return a + b; }
int e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		vector<int>a(n);
		rep(i, n)cin >> a[i], a[i]--;
		deque<int>deq;
		segtree<int, op, e>seg(n);
		long long sum = 0;
		rep(i, n) {
			int f = seg.prod(0, a[i]);
			int b = seg.prod(a[i], n);
			sum += min(f, b);
			if (f < b)deq.push_front(a[i]);
			else if(b < f)deq.push_back(a[i]);
			else {
				if(deq.empty() || a[i] < deq.front())deq.push_front(a[i]);
				else deq.push_back(a[i]);
			}
			seg.set(a[i], 1);
		}
		cout << sum << endl;
		while (!deq.empty()) {
			cout << deq.front() + 1 << " ";
			deq.pop_front();
		}
		cout << endl;
	}
	return 0;
}