归并排序模版

本人自写

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,x,y) for(int i=(x);i<=(y);i++)
#define fu(i,x,y) for(int i=(x);i>=(y);i--)
const int N=3e6+5;
int n,a[N],b[N],ans;
void sot(int l,int r){
	if(l==r)return ;
	int mid=l+r>>1;
	sot(l,mid);sot(mid+1,r);
	int il=l,ir=mid+1,ib=l-1;
	while(il<=mid&&ir<=r){
		if(a[il]<=a[ir])b[++ib]=a[il++];
		else b[++ib]=a[ir++],ans+=mid-il+1;
	}
	while(il<=mid)b[++ib]=a[il++];
	while(ir<=r)b[++ib]=a[ir++];
	fo(i,l,r)a[i]=b[i];
	return ;
}
signed main(){
	// freopen("test8.in","r",stdin);
	// freopen("test8.out","w",stdout);
	scanf("%lld",&n);
	fo(i,1,n)scanf("%lld",&a[i]);
	sot(1,n);
	// sort(a+1,a+n+1);
	// fo(i,1,n)printf("%d ",a[i]);
	printf("%lld",ans);
}