https://codeforces.com/contest/1399/submission/229486965
I am iterating on all edges and storing all possible contribution. Then sorting it and using two pointer. Complexity: O(nlogw.log(nlogw)). It is same as jiangly solution. But I am getting Runtime error. I t already tried looking for index out of bounds and memory limit
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
while(j >= 0 && cur-e[1][j-1] >= need)
Thanks.