19 lines
410 B
C++
19 lines
410 B
C++
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
const int N = 1e5 + 10;
|
|
int a[N], t[N];
|
|
void merge_sort(int l,int r){
|
|
if(l>=r)return;
|
|
int mid=(l+r)/2;
|
|
merge_sort(l, mid), merge_sort(mid + 1, r);
|
|
int i=l,j=mid+1,k=0;
|
|
while(i<=mid&&j<=r)
|
|
if (a[i] <= a[j]) t[k++] = a[i++];
|
|
else
|
|
t[k++] = a[j++];
|
|
while(i<=mid)
|
|
}
|
|
int main() {
|
|
|
|
return 0;
|
|
} |