@[DEVINTHELAB](/user/1053006) 请查看题解。[查看题解](https://www.luogu.com.cn/problem/solution/P1271)
by Terrible @ 2023-11-21 19:12:45
@[Terrible](/user/195942) 选排和冒泡不行吗
by DEVINTHELAB @ 2023-11-21 19:14:59
@[DEVINTHELAB](/user/1053006) (1≤m≤2000000)要用sort或者快排
by zhouzihang1 @ 2023-11-21 19:20:28
你猜猜你为什么TLE?
by Terrible @ 2023-11-21 19:23:26
@[zhouzihang1](/user/827018) 知道了谢谢
by DEVINTHELAB @ 2023-11-21 19:25:43
@[Terrible](/user/195942) 我知道的不多,只会用选排和冒泡,不会用sort?
by DEVINTHELAB @ 2023-11-21 19:27:00
@[DEVINTHELAB](/user/1053006) 你没看到两重循环吗?时间复杂度都到 $O(n ^ 2)$ 了,能不 TLE 吗?复杂度最高有 $999 ^ 2$ ,这个数非常大
by UzumakiBoruto @ 2023-11-21 19:32:21
把冒泡排序的部分换成 ```sort(a+1,a+m);``` 就行了
by UzumakiBoruto @ 2023-11-21 19:34:19
@[UzumakiBoruto](/user/1152121) 嗯嗯知道了
by DEVINTHELAB @ 2023-11-21 19:35:27
$归并排序$
by bcbgszyzh @ 2023-12-17 20:59:41