multiset是O(nlogn)的，过不去$10^7$
by _QWQ_TAT_ @ 2024-04-05 11:37:44
@[NEYCzsj](/user/1126949)
by _QWQ_TAT_ @ 2024-04-05 11:37:55
得用两个队列去O(n)的解决
by _QWQ_TAT_ @ 2024-04-05 11:38:20
@[scx123456](/user/1011907) 我是蒟蒻，麻烦问一下啥是O(nlogn)
by NEYCzsj @ 2024-04-05 11:39:35
时间复杂度是O(nlogn)，你可以去百度上面搜一下multiset的时间复杂度 @[NEYCzsj](/user/1126949)
by _QWQ_TAT_ @ 2024-04-05 11:41:34
@[scx123456](/user/1011907) 哦哦
by NEYCzsj @ 2024-04-05 11:52:18
@[NEYCzsj](/user/1126949) 排序不能用快排，因为快排也是 $n \log n$ 的，用桶排，时间复杂度是 $\max_{i=1}^{n}a_i$
by danlao @ 2024-04-05 12:03:06