#39788: c++ bubble sort
mu0975353917@gmail.com
(Moon Chan)
#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;
}
}