#include <bits/stdc++.h> 
using namespace std;
typedef long long ll;
const int N = 1e5+10,M = 1e7+10;
int t,n;
ll s[N],v[N];
struct made{
    ll l,r,x;
    int id;
}a[N];
bool cmp(made x,made y){
    return x.x < y.x;
}
int main(){
    freopen("sort.in","r",stdin);
    freopen("sort.out","w",stdout);
    scanf("%d",&t);
    while(t--){
        ll s1 = 0,s2 = 0;
        memset(v,0,sizeof(v));
        scanf("%d",&n);
        for(int i = 1;i <= n;i++){
            scanf("%lld",&a[i].x);
            a[i].id = i;
        }
        sort(a+1,a+1+n,cmp);
        for(int i = 1;i <= n;i++){
            if(v[a[i].id])continue;
            s1 += a[i].x;
            for(int j = min(i,a[i].id);j <= max(i,a[i].id);j++)v[j] = 1;
        }
        printf("%lld\n",s1);
    }
    
    
    return 0;
}