| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Hello
Is there any easy way to implement a set supporting following 2 operations in O(log(n)) ?
1)Insertion
2)Count of elements in the set having value <= x. (x is an Integer)
Values inside set can be from 1 to 1e9.
I am sorry if this in an easy/standard problem.
Try this
You can use Ordered Set
Auto comment: topic has been updated by vijasi (previous revision, new revision, compare).
A set can't do the 2nd operation in O(log(n))
but an ordered set can check Policy-based data structures