归并排序/逆序对

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int nxd;
int arr[N],dv[N],n; 
void inline pai(int l,int r) {
	if(l==r)return;
	int mid=(l+r)>>1;
	pai(l,mid);
	pai(mid+1,r);
	int i=l,j=mid+1,k=l;
	while(i<=mid&&j<=r) {
		if(arr[i]<=arr[j]) {
			dv[k++]=arr[i++];
		}
		else {
			dv[k++]=arr[j++];
			nxd+=mid-i+1;//逆序对的逻辑
		}
	}
	while(i<=mid)dv[k++]=arr[i++];
	while(j<=r)dv[k++]=arr[j++];
	for(int t=l;t<=r;++t)arr[t]=dv[t];
}
int main() {
	cin>>n; 
	for(int i=1;i<=n;i++)cin>>arr[i];
	pai(1,n);
	cout<<nxd<<endl;
	for(int i=1;i<=n;++i)cout<<arr[i]<<" ";
}