这题要用堆
by lndjy @ 2020-03-28 13:44:30
@[RayZhu](/user/305941) 你是否明白sort的复杂度?不明白的话百度吧
by Smile_Cindy @ 2020-03-28 13:46:42
@[RayZhu](/user/305941) TLE一般就是算法有问题,不会的话可以看看题解
by liqingyang @ 2020-03-28 13:51:32
合并果子是这样做的吗?
如果真是这么做那么他就变红橙题了
by ThreePlusSeven @ 2020-03-28 14:02:01
@[ThreePlusSeven](/user/229067) ~~我个人认为这道题本来就是橙的~~
by liqingyang @ 2020-03-28 14:04:37
复杂度$\text{O}(n^2\log n)$
by Celtic @ 2020-03-28 14:07:29
@[Celtic](/user/176990) 嗯嗯,肯定超时!
by liqingyang @ 2020-03-28 14:07:56
@[RayZhu](/user/305941) 还有您应该不止是超时吧,应该还有WA吧?
by liqingyang @ 2020-03-28 14:09:32
@[RayZhu](/user/305941) 可以百度优先队列
by asasas @ 2020-03-28 14:10:00
@[RayZhu](/user/305941)
这道题要用priority_queue
每遍都sort一遍$n^2logn^2$绝对超时
by michael_song @ 2020-03-28 14:21:29