struct node{
int i, j, val;
};
set<node> A;
I insert many nodes in A. Now I want to get the lower_bound for some val = k. How do I use A.lower_bound() in this case?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
lower_bound in set<node>
struct node{
int i, j, val;
};
set<node> A;
I insert many nodes in A. Now I want to get the lower_bound for some val = k. How do I use A.lower_bound() in this case?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | rachitiitr | 2016-05-31 22:26:05 | 2 | |||
en3 | rachitiitr | 2016-05-31 22:25:38 | 33 | Tiny change: '; \n\nset A; \nI ' -node\ | ||
en2 | rachitiitr | 2016-05-31 22:24:47 | 41 | |||
en1 | rachitiitr | 2016-05-31 22:23:52 | 199 | Initial revision (published) |
Name |
---|