#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int t,n;
const int MAXN=1e7+5;
int a[100005];
int t1[MAXN],t2[MAXN];
int main(){
    freopen("sort.in","r",stdin);
    freopen("sort.out","w",stdout);
    cin>>t;
    while(t>0){
        t--;
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            t1[a[i]]=i;
        }
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++){
            t2[a[i]]=i;
        }
        int ans=0;
        int sum1=0,sum2=0;
        for(int i=1;i<=n;i++){
            if(t1[a[i]]>t2[a[i]]){
                sum1+=a[i];
            }else if(t1[a[i]]<t2[a[i]])sum2+=a[i];
        }
        ans=min(sum1,sum2);
        cout<<ans<<endl;
    }
    return 0;
}