a539. 10327 - Flip Sort -- UVa10327 | From: [36.233.6.142] | 發表日期 : 2024-03-30 11:37

#include<bits/stdc++.h>

using namespace std;

int main(){

int n,num;

vector<int> v;

while(cin>>n){

v.clear();  //清空vector內的值 

for(int i=0;i<n;i++){

cin>>num;

v.push_back(num);

 

}

long long int tmp=0,count=0;

for(int j=0;j<v.size();j++)

{

for(int k=j+1;k<v.size();k++) //k=j+1

{

//cout<<j<<" "<<k<<endl;

if(v[k]<v[j]) //v[k]<v[j]

{

count++;

}

}

}

cout<<"Minimum exchange operations : "<<count<<endl;

}

}