set<int>s;
s.erase(s.begin());
I wanted to know whether removing the minimum element in set is a O(logN) or O(1) operation ?
I am quite confused about this situation.
Thanks in advance..
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.12.2024 18:00:04 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
It takes amortized constant time. See here set::begin and here set::erase.
Thanks buddy
It says just "constant" (doesn't say about amortisation), but I doubt that's true.
"For the first version (erase(position)), amortized constant." (where position is an iterator) from http://www.cplusplus.com/reference/set/set/erase/
ah, sorry, I just followed Jakube's links, but both of them apparently go to std::set::begin
Yes, I noticed that too :)
Sorry, I fixed the link.