# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 162 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 154 |
8 | pajenegod | 147 |
9 | BledDest | 145 |
9 | Um_nik | 145 |
Name |
---|
Yes it is:
Greedy solution will take book with value $$$9$$$ and won't be able to take any more, while it is possible to read two books if you take $$$10$$$ and $$$1$$$
I've tired solving it by using binary search and cumulative arrays but it still gets wrong answer in 7 test cases. Please help !! https://ideone.com/hKp3EV
Cumulative arrays is correct, but then you do wiered things. Instead you need to check each possible combination of both stacks. One of those combinations result is max number of books.
Thanks a lot. I've solved it