0/1 Knapsack

1s

256MB

1400

0%

DP

Given $N$ items each with weight $w_i$ and value $v_i$ , and a knapsack capacity $W$ , find the maximum total value achievable.

First line: $N$ $W$ . Next $N$ lines: $w_i$ $v_i$ .

Maximum total value.

$1 \le N \le 10^3$ , $1 \le W \le 10^5$

Оролт1

Гаралт1

Take items 2 and 3 for total value $4 + 5 = 9$

0.1 / 64 KiB

Редактор уншиж байна...