| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | atcoder_official | 160 |
| 3 | maomao90 | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | Dominater069 | 155 |
| 8 | adamant | 154 |
| 9 | luogu_official | 153 |
| 10 | awoo | 152 |
upper_bound(multiset.begin(),multiset.end(),x) vs multiset.upper_bound(x) in C++
In this problem 1008C - Перестановка массива
I used upper_bound(multiset.begin(),multiset.end(),x) and got TLE.
TLE Sub: 77006832
But when I used multiset.upper_bound(x), I got accepted!
AC Sub:77081261
Can anyone explain to me why inbuilt upper_bound() is slower than the member upper_bound() function of std::multiset?
