#include <stdio.h>

void add_BIT(int N, int BIT[], int i, int k)
{
	while (i <= N) {
		BIT[i] += k;
		i += (i & -i);
	}
}

int sum_BIT(int BIT[], int r)
{
	int sum = 0;
	while (r > 0) {
		sum += BIT[r];
		r -= (r & -r);
	}
	return sum;
}

void solve(int n, int P[])
{
	int i, j, head = n, tail = n;
	long long inv = 0;
	static int BIT[200001], ans[400001];
	for (i = 0; i <= n; i++) BIT[i] = 0;
	for (i = 1; i <= n; i++) {
		j = sum_BIT(BIT, P[i]);
		add_BIT(n, BIT, P[i], 1);
		if (j * 2 < i - 1) {
			ans[--head] = P[i];
			inv += j;
		} else if (j * 2 > i - 1) {
			ans[tail++] = P[i];
			inv += i - 1 - j;
		} else {
			if (i == 1 || P[i] < ans[head]) {
				ans[--head] = P[i];
				inv += j;
			} else {
				ans[tail++] = P[i];
				inv += i - 1 - j;
			}
		}
	}
	
	printf("%lld\n", inv);
	for (i = head; i < tail - 1; i++) printf("%d ", ans[i]);
	printf("%d\n", ans[i]);
}

int main()
{
	int T, i, n, P[200001];
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		for (i = 1; i <= n; i++) scanf("%d", &(P[i]));
		solve(n, P);
	}
	fflush(stdout);
	return 0;
}