Atcoder D - Knapsack 1 （背包）

D - Knapsack 1

---

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : $100100$ points

Problem Statement

There are $\mathrm{NN}$ items, numbered $\mathrm{1,2,\dots ,N1,2,\dots ,N}$. For each $\mathrm{ii}$ ($\mathrm{1\le i\le N1\le i\le N}$), Item $\mathrm{ii}$ has a weight of ${\mathrm{wiwi}}^{}$ and a value of ${\mathrm{vivi}}^{}$.

Taro has decided to choose some of the $\mathrm{NN}$ items and carry them home in a knapsack. The capacity of the knapsack is $\mathrm{WW}$, which means that the sum of the weights of items taken must be at most $\mathrm{WW}$.

Find the maximum possible sum of the values of items that Taro takes home.

Constraints

• All values in input are integers.
• $\mathrm{1\le N\le 1001\le N\le 100}$
• $\mathrm{1\le W\le 1051\le W\le 105}$
• $\mathrm{1\le wi\le W1\le wi\le W}$
• $\mathrm{1\le vi\le 1091\le vi\le 109}$

---

Input

Input is given from Standard Input in the following format:

$\mathrm{NN}$ $\mathrm{WW}$
${\mathrm{w1w1}}^{}$ ${\mathrm{v1v1}}^{}$
${\mathrm{w2w2}}^{}$ ${\mathrm{v2v2}}^{}$
$::$
${\mathrm{wNwN}}^{}$ ${\mathrm{vNvN}}^{}$

Output

Print the maximum possible sum of the values of items that Taro takes home.

---

Sample Input 1 Copy

Copy

3 8
3 30
4 50
5 60

Sample Output 1 Copy

Copy

90

Items $11$ and $33$ should be taken. Then, the sum of the weights is $\mathrm{3+5=83+5=8}$, and the sum of the values is $\mathrm{30+60=9030+60=90}$.

---

Sample Input 2 Copy

Copy

5 5
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000

Sample Output 2 Copy

Copy

5000000000

The answer may not fit into a 32-bit integer type.

---

Sample Input 3 Copy

Copy

6 15
6 5
5 6
6 4
6 6
3 5
7 2

Sample Output 3 Copy

Copy

17

Items $\mathrm{2,42,4}$ and $55$ should be taken. Then, the sum of the weights is $\mathrm{5+6+3=145+6+3=14}$, and the sum of the values is $\mathrm{6+6+5=176+6+5=17}$.

 

题目链接：https://atcoder.jp/contests/dp/tasks/dp_d

　　题意：有N个团队，每一个团队有w[i]个人，并且有v[i]的贡献值。

现在你有一个W的容量的公司，你需要从这n个团队中挑选出几个（每一个团队只能挑选一次），使之团队人数的总和小于W，并且贡献值的总和尽可能的大。

思路：裸的普通的背包问题。

我的AC代码：

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

 

转载于:https://www.cnblogs.com/qieqiemin/p/10252158.html