杭电5122 K.Bro Sorting

#include <iostream>
#include <cstdio>

using namespace std;

int t,n;
int a[1000010];

int main()
{
scanf("%d",&t);
int kase = 1;
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int minn = a
;
int ans = 0;
for(int i=n;i>=1;i--)
{
if(a[i] > minn)
ans++;
else
minn = a[i];
}
printf("Case #%d: %d\n",kase++,ans);
}
return 0;
}