#include<bits/stdc++.h>
using namespace std;
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld%lld",&x,&y)
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pf(x) printf("%lld",x)
#define pii pair<int,int> 
#define f first 
#define s second
#define int long long



//
//
const int N = 5e5+10;
int q[N];
int m;
//
int cnt;
void quick_sort(int q[], int l, int r)
{
	if (l >= r) return;
	
	int i = l - 1, j = r + 1, x = q[l + r >> 1];
	while (i < j)
	{
		do i ++ ; while (q[i] < x);
		do j -- ; while (q[j] > x);
		if (i < j) swap(q[i], q[j]),cnt++;
	}
	quick_sort(q, l, j), quick_sort(q, j + 1, r);
}

void solve()
{
	cin>>m;
	
	for(int i=1;i<=m;i++) cin>>q[i];
	quick_sort(q,1,m);
	cout<<cnt<<endl;
	cnt=0;
}
signed main()
{
	IOS;
	int _=1;
	cin>>_;
	while(_--)
		solve();
	return 0;
}