#include<iostream>
#include<cstdio>
using namespace std;
const int MX=500050;

int T, N, num=0;
int br[MX], ar[MX];
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
int part(int a[], int lo, int hi)
{
    int pivot=a[(lo+hi)/2];
    int i=lo, j=hi;
    while(1)
    {
        while(a[i]<pivot) i++;
        while(a[j]>pivot) j--;
        if(i>=j) return j;
        swap(a[i],a[j]), num++;
    }
}
void qsort(int a[], int lo, int hi)
{
    if(lo>=0&&hi>=0&&lo<hi)
    {
        int p=part(a,lo,hi);
        qsort(a,lo,p);
        qsort(a,p+1,hi);
    }
}
int main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read(); num=0;
        for(int i=1;i<=N;i++) br[i]=ar[i]=read();
        qsort(br,1,N);
        cout << num << '\n';
    }
    return (0-0);
}