#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos((long double)-1.0);
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
template <typename T>
void cmin(T &x, T y) {
  if (y < x) x = y;
}
template <typename T>
void cmax(T &x, T y) {
  if (y > x) x = y;
}
long long qpow(long long x, long long n, long long mod = MOD) {
  if (n < 0) return 0;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
long long sq(long long x) { return x * x; }
long long read() {
  long long res = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    res = res * 10 + (c - '0');
    c = getchar();
  }
  return res;
}
int n;
int a[200005];
namespace Solver {
void InitOnce() {
  int t;
  scanf("%d", &t);
}
void Read() {
  int res = scanf("%d", &n);
  if (res == -1) exit(0);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
}
void Solve() {
  int minprice = INF;
  int ans = 0;
  for (int i = n; i >= 1; --i) {
    cmin(minprice, a[i]);
    if (a[i] > minprice) ++ans;
  }
  printf("%d\n", ans);
}
}  // namespace Solver
int main() {
  Solver::InitOnce();
  while (true) {
    Solver::Read();
    Solver::Solve();
  }
  return 0;
}
