void merge(vector<int> &arr, int left, int center, int right){
int n=right-left+1;//临时数组存合并后的有序序列
vector<int>tmp(n,0);
int i=0;
int _left=left;
int _right=center+1;
while(_left<=center && _right<=right)
tmp[i++] = arr[_left]<= arr[_right]?arr[_left++]:arr[_right++];
while(_left<=center)
tmp[i++]=arr[_left++];
while(_right<=right)
tmp[i++]=arr[_right++];
for(int j=0;j<n;++j)
arr[left+j]=tmp[j];
//delete [] tmp;//删掉堆区的内存
}
void mergesort(vector<int>&arr, int l, int r){
if(l==r)
return; //递归基是让数组中的每个数单独成为长度为1的区间
int q = (l + r)/2;
mergesort(arr, l, q);
mergesort(arr, q + 1, r);
merge(arr, l, q, r);
}