请在
```cpp
while(zuo<=mid||you<=r){
if(zuo<=mid&&(you==r+1||a[zuo].y<a[you].y))
save[++tot]=a[zuo],zuo++;
else save[++tot]=a[you],you++;
}
```
前面存储下 `a[mid].x` 的值，否则会改变
by liangbowen @ 2023-05-01 11:27:28
@[liangbowen](/user/367488) 感谢 dl！%%%orz
by sgl654321 @ 2023-05-01 11:32:40
~~114分~~
by qwertim @ 2023-05-26 13:42:02
我也是114分，36个TLE
复杂度O(n(n+1)/2)
by _GGG @ 2023-07-20 17:14:43
@[_GGG](/user/957205) 您这算法复杂度一看就会 TLE 啊。
by Eirin_Yagokoro @ 2023-08-11 20:49:21
降到O(n^1.5还是超时)
by _GGG @ 2023-08-13 13:11:46
而且加强版是100分
by _GGG @ 2023-08-13 13:12:16