[ZJ]b373: [福州19中]车厢重组

題目：
http://zerojudge.tw/ShowProblem?problemid=b373

---------------------------------------------------------------------------------------------------

#include<cstdio>
#define maxn 10000+1
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int a[maxn] = {0},ans = 0,temp = 0;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);

for (int i = n - 1; i > 0; --i)
{
for (int j = 0; j < i; ++j)
{
if (a[j] > a[j + 1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
//swap(a[j], a[j + 1]);
ans++;
}
               
}
}
        printf("%d\n",ans);

}
return 0;
}