归并排序求逆序对

#include<iostream>
using namespace std;
int n,num;
int a[100010],c[100010];
void merge_sort(int l,int r)
{
	int mid=(l+r)/2; 
	if(l<r)
	{
		merge_sort(l,mid);
		merge_sort(mid+1,r);
		int i=l;
		int j=mid+1;
		int k=0;
		while(i<=mid&&j<=r)
		{
			if(a[i]>a[j])
			{
				num+=mid-i+1;
				c[++k]=a[i++];
			}
			else 
			{
				c[++k]=a[j++];
			}
		}	
		while(i<=mid)
		{
			c[++k]=a[i++];
		}
		while(j<=r)
		{
			c[++k]=a[j++];
		}
		k=1;
		for(int i=l;i<=r;i++)
		{
			a[i]=c[k++];
		}
	}
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	merge_sort(1,n);
	for(int i=1;i<=n;i++)
		cout<<a[i]<<" ";
	cout<<endl;
	cout<<n*(n-1)/2-num<<endl;
	return 0;
}