#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define rep(i, n) for(int i=0;i<(n);++i) #define rep1(i, n) for(int i=1;i<=(n);i++) #define ll long long using mint = modint998244353; using P = pair<ll,ll>; using lb = long double; using T = tuple<ll, ll, ll>; #ifdef LOCAL # include <debug_print.hpp> # define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define dbg(...) (static_cast<void>(0)) #endif int main() { int t; cin >> t; while(t--) { int n; cin >> n; vector<int> p(n); rep(i,n) cin >> p[i]; fenwick_tree<int> bit(n+1); deque<int> q; ll ans = 0; rep(i,n) { int l = bit.sum(0, p[i]); int r = bit.sum(p[i], n+1); ans += min(l,r); if(l<r) { q.push_front(p[i]); } else if(r<l) { q.push_back(p[i]); } else{ if(p[i]<q.front()) q.push_front(p[i]); else q.push_back(p[i]); } bit.add(p[i],1); } cout << ans << endl; while(!q.empty()) { int u = q.front(); q.pop_front(); cout << u; if(!q.empty()) { cout<<" "; } } cout<<endl; } return 0; }