[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
Problem Description
多组输入。
对于每组输入，第一行有两个整数N，X（1 < = N < = 100，1 < = X < = 1000），分别表示哈士奇的数量和高数巨的钱数
对于每组数据，输出一个整数，表示高数巨最多可以获得的萌值，每组输出占一行
Example Input
2 100 50 20 60 40 3 100 20 55 20 35 90 95 1 10 20 50
Example Output
40 95 0
Hint
上午学长刚讲的背包问题， 属于01背包
关键代码
for i=1..N
for v=V..0
f[v]=max{f[v],f[v-c[i]]+w[i]};
01 #include<stdio.h>
02 #include<string.h>
03 int max(int a, int b);
04 int main()
05 {
06 int n, x, p[111], m[111], j, i;
07 int a[1005];
08 while(scanf("%d%d", &n, &x) != EOF)
09 {
10 memset(a, 0, sizeof(a));
11 memset(p, 0, sizeof(p));
12 memset(m, 0, sizeof(m));
13 for(i = 1; i <= n; i++)
14 scanf("%d%d", &p[i], &m[i]);
15 for(i = 1; i <= n; i++)
16 {
17 for(j = x; j >= 0; j--)
18 if(j >= p[i])
19 a[j] = max(a[j], a[j - p[i]] + m[i]);
20 }
21 printf("%d\n", a[x]);
22 }
23 return 0;
24 }
25 int max(int a, int b)
26 {
27 return a > b? a : b;
28 }
29
