| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hello codeforces forum , I am getting WA on test 9 and 11 . Tried many times to find the bug , but failed . Can you please provide me some test case which my code give WA .
problem link : https://csacademy.com/contest/archive/task/socks-pairs/statement/
My code : http://paste.ubuntu.com/25060704/
3 4
3 4 4
Thank you for your kind reply .
For
4 5
2 4 6 8
how ans is 13 ? Ans should be 12 . shouldn't it? If ans is 12 , in which case it will worng ? I can not find it .
your idea is not correct.
What would be worst case, for above example?
Take 1 from color 1, 3 from color 2, 5 from color 3, 3 from color 4. We got 4 pair of socks until now, and sum 1 + 3 + 5 + 3 = 12. Now you can take 1 more sock from color 1, obtain sum 13 and have 5 pairs.
In general, worst case is when we choose odd number of socks from each color at first, until we get maximum number of pairs,smaller than k. And then we add more socks to reach k.