| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
https://mirror.codeforces.com/contest/810/problem/B see this problem and see my code https://pastebin.com/U3p3vCwD
my approach: i make pair,find maximum v[i].first and then check if second is >0 then multiply it.
if u dont understand my code just try to analyze my code.i think its pretty straightforward.
most of the times, greedy algorithms that comes to our mind are wrong and there is nothing wrong in that but with practice intuition improves. I read this in a book. :/
How do you even know that it's wrong if you still haven't submitted your solution to codeforces judge? Do you maybe get a wrong answer for the examples given in the problem statement? There are some explanations about the examples in the Note section.
Also how do you know that it's "greedy"? Is your account configured to show tags for unsolved problems? This information is a major spoiler and generally makes practice much less efficient.