/* the idea is to take the k smallest elements in vector and by prefix array check all the choices to find the mi answer */
/* the idea is to take the k smallest elements in vector and by prefix array check all the choices to find the mi answer */
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 160 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | Um_nik | 151 |
| 7 | djm03178 | 151 |
| 9 | luogu_official | 149 |
| 10 | awoo | 147 |
Auto comment: topic has been updated by My_LastGoodbye (previous revision, new revision, compare).
Auto comment: topic has been updated by My_LastGoodbye (previous revision, new revision, compare).
how can i find cases like 150 or 300 ? does codeforces provide easy way to find it. thanks!