试试int~~不知道会不会见祖宗啊~~
by pi3141592 @ 2023-05-10 21:25:41
@[jeoflorr32](/user/777844)
会~~我屑屑你~~
[垃圾](https://www.luogu.com.cn/record/110016723)
by dongrq_cs @ 2023-05-10 21:28:33
@[dongrq_cs](/user/644394) 正解不是堆么？
by __er @ 2023-05-10 21:29:54
@[dongrq_cs](/user/644394) 用优先队列做啊
by first_king @ 2023-05-10 21:31:03
dp[10005][10005]不会爆空间就怪了。
by IcyFoxer_XZY @ 2023-05-10 21:33:44
```priority_queue<int,vector<int >,greater<int > > b;```
by first_king @ 2023-05-10 21:34:21
@[dongrq_cs](/user/644394) 好解思路：先将队列排序，再while，判断条件为队列的size不为1，for循环一下，加队首，然后pop，算完在插入就行，
by first_king @ 2023-05-10 21:39:09
最后输出结果
by first_king @ 2023-05-10 21:39:34
@[winter_warm](/user/995980) 你这个只适用于削弱版
by tcy01_QAQ_ @ 2023-05-10 21:44:50