ACM-Sort it

描述

You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.

输入

The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 1000); the next line contains a permutation of the n integers from 1 to n.

输出

For each case, output the minimum times need to sort it in ascending order on a single line.

样例输入

3
1 2 3
4 
4 3 2 1 

样例输出

0
6

代码：

#include<iostream>
using namespace std;
int main()
{
    int t;

    while(cin>>t)
    {
        int a[1000];
        int i,temp,count = 0;
        for(i = 0;i < t;i++)
            cin>>a[i];
        for(i= 0;i < t;i++)
            for(int j = 0;j < t-i-1;j++)
        {
            if(a[j]>a[j+1])
            {
                temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
                count++;
            }
        }
            cout<<count<<endl;
    }
    return 0;
}