I often have problems when I need to find a certain 'x' in the position of the first elements in the pair vector. Of course, it's better to write your own binary search. But can someone explain how it works anyway?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
I often have problems when I need to find a certain 'x' in the position of the first elements in the pair vector. Of course, it's better to write your own binary search. But can someone explain how it works anyway?
Name |
---|
They work in the same way as integers. Pairs by default are compared by the first elements, if the first elements are equal then compare by second elements.
Ok, thanks
Same with tuples. If their elements are equal, they are checking second, third and so on.