爸爸写的
#include<bits/stdc++.h>
using namespace std;
int a[100005];
int b[100005];
long long ans = 0;
void m(int l,int r){
int p1 = l ,mid = (r+l)/2 , p2 = mid +1, p = l;
while( p1<=mid && p2<=r ){
if(a[p1]<=a[p2]){
b[p++] = a[p1++];
}else{
b[p++] = a[p2++];
ans=ans+mid-p1+1;
}
}
while(p1<=mid){
b[p++] =a[p1++];
}
while(p2<=r){
b[p++] =a[p2++];
}
for(int i=l;i<=r;i++){
a[i]=b[i];
// printf("%d ",a[i]);
}
// cout<<endl;
}
void msort(int l,int r){
if(l==r){
return ;
}
int mid = (l+r)/2;
msort(l,mid);
msort(mid+1,r);
m(l,r);
}
int main(){
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
msort(0,n-1);
cout<<ans<<endl;
return 0;
}