Hello, I am preparing a mashup contest, I want to assign scores for each problem. Like a normal codeforces div.
How can I achieve this?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Hello, I am preparing a mashup contest, I want to assign scores for each problem. Like a normal codeforces div.
How can I achieve this?
hello codeforces!
Today I thought of this variation of the knapsack problem and I couldn't find a solution.
We have $$$n$$$ items ($$$n$$$ is up to $$$10^{6}$$$). There are $$$sz_i$$$ copies of the $$$i_{th}$$$ item.
$$$\sum sz_i$$$ won't exceed $$$10^6$$$
We can pick more than one copy of each item, if we decided to pick $$$j$$$ copies of the $$$i_{th}$$$ item our score increases by $$$value[i][j]$$$
Our goal is to pick $$$k$$$ ($$$k$$$ is up to $$$10^6$$$) copies in total in a way that will maximize our score.
This sounds very standard to me, what is the solution for that?
| Название |
|---|


