hi guys i was trying to use multiset to reduce its complexity almost to n^2 but couldnt do so. what i was trying to do is checking the previous ones it was sorted in multiset then taking out left ones i need help!! here is my code->> https://codeforces.com/contest/1185/submission/55820062
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 5 | maroonrk | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/26/2024 12:35:44 (k3).
Desktop version, switch to mobile version.
Supported by
Multiset solution shouldn't pass because of $$$O(n^2 \log n)$$$ worst case. Try to implement the solution described in the editorial, which is way simpler and way faster, and it runs in $$$O(nt)$$$