归并排序求数组小和和逆序对

#include <iostream>  
#include <string.h>  
#include <stdio.h>  

using namespace std;
const int N = 1005;

//int a[N], 
int tmp[N];
int ans;
int a[] = { 1,3,5,2,4,6 };
void Merge(int l, int m, int r)
{
    int i = l;
    int j = m + 1;
    int k = l;
    while (i <= m && j <= r)
    {
        if (a[i] > a[j])
        {
            tmp[k++] = a[j++];
            //ans += m - i + 1;       //求逆序对
        }
        else
        {
            ans+= (r - j + 1)*a[i];   //求小和
            tmp[k++] = a[i++];

        }
    }
    while (i <= m) tmp[k++] = a[i++];
    while (j <= r) tmp[k++] = a[j++];
    for (int i = l; i <= r; i++)
        a[i] = tmp[i];
}

void Merge_sort(int l, int r)   //归并排序主调函数
{
    if (l < r)
    {
        int m = (l + r) >> 1;
        Merge_sort(l, m);
        Merge_sort(m + 1, r);
        Merge(l, m, r);
    }
}

int main()
{
    Merge_sort(0, 5);
    cout << ans << endl;
    return 0;
}