uva 10327 Flip Sort

冒泡排序的交换次数是逆序对

#include<iostream>
#include <cstdio>
#include <vector>

using namespace std;
int main()
{
    int n,temp,ans,i,j;
    vector<int> INT_NUM;
    while(scanf("%d",&n)!=EOF)
    {
        INT_NUM.clear();
        ans = 0;
        for(i = 0; i<n; i++)
        {
            scanf("%d",&temp);
            INT_NUM.push_back(temp);
        }
        for(i=0;i<n-1;i++)
        {
            for(j=i+1;j<n;j++)
                if(INT_NUM[i]>INT_NUM[j])
                ans++;
        }
        printf("Minimum exchange operations : %d\n",ans);
    }
    return 0;

}