I mean iam cyan and can't solve a 1300 rated problem i wanted to go with greedy approach but for some reason I'm getting WA , also i saw A LOT of submission failing with the same test case that my code fail with so can someone tell what iam doing wrong problem if just too easy and still cant solve it , sub:288972222 , problem : 2022B - Kar Salesman
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 6 | adamant | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/31/2024 02:21:24 (i1).
Desktop version, switch to mobile version.
Supported by
3
1 1 5
You just need to satisfy two conditions.
First condition: There should be at least $$$max(a_i)$$$ for $$$1<=i<=n$$$ as a customer can not buy more than 1 car from the same model.
Second condition: There should be enough customers such that all cars can be sold.