poj2299+归并排序+注意输出来的那个数据的类型。。。

#include<iostream>
#include<cstdio>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int Arr[500005] = { 0 }, temp[500005] = { 0 }, N = 0;
__int64 num;
void merge(int low,int m, int high)
{
int i = low, j = m + 1,n=0,length=high-low;
while (i <= m&&j <= high){
if (Arr[i] > Arr[j]){
temp[n++] = Arr[j++];
num += m - i + 1;
}
else{
temp[n++] = Arr[i++];
}
}
if (i >m){
while (j <= high)
temp[n++] = Arr[j++];
}
else{
while (i <= m)
temp[n++] = Arr[i++];
}
for (i = 0; i <= length; i++){
Arr[low + i] = temp[i];
}
}
void  mergesort(int left, int right)
{
if (left < right){
int mid = (left + right) / 2;
mergesort(left, mid);
mergesort(mid + 1, right);
merge(left,mid, right);
}
}
int main()
{
int i=0;
while ((cin >> N)&& N != 0){
for (i = 0; i < N; i++)
cin>>Arr[i];
mergesort(0, N - 1);
printf("%lld\n", num);
num = 0;
}
return 0;
}