01背包 动态规划
2015-08-12 19:39
357 查看
C. Dima and Salad
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Dima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.
Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make
a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k.
In other words,
,
where aj is
the taste of the j-th chosen fruit and bj is
its calories.
Inna hasn't chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!
Inna loves Dima very much so she wants to make the salad from at least one fruit.
Input
The first line of the input contains two integers n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10).
The second line of the input contains n integersa1, a2, ..., an (1 ≤ ai ≤ 100) —
the fruits' tastes. The third line of the input contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 100) —
the fruits' calories. Fruit number i has taste ai and
calories bi.
Output
If there is no way Inna can choose the fruits for the salad, print in the single line number -1. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.
Sample test(s)
input
output
input
output
Note
In the first test sample we can get the total taste of the fruits equal to 18 if we choose fruit number 1 and fruit number 2, then the total calories will equal 9. The condition
fulfills,
that's exactly what Inna wants.
In the second test sample we cannot choose the fruits so as to follow Inna's principle.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Dima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.
Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make
a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k.
In other words,
,
where aj is
the taste of the j-th chosen fruit and bj is
its calories.
Inna hasn't chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!
Inna loves Dima very much so she wants to make the salad from at least one fruit.
Input
The first line of the input contains two integers n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10).
The second line of the input contains n integersa1, a2, ..., an (1 ≤ ai ≤ 100) —
the fruits' tastes. The third line of the input contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 100) —
the fruits' calories. Fruit number i has taste ai and
calories bi.
Output
If there is no way Inna can choose the fruits for the salad, print in the single line number -1. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.
Sample test(s)
input
3 2 10 8 1 2 7 1
output
18
input
5 3 4 4 4 4 4 2 2 2 2 2
output
-1
Note
In the first test sample we can get the total taste of the fruits equal to 18 if we choose fruit number 1 and fruit number 2, then the total calories will equal 9. The condition
fulfills,
that's exactly what Inna wants.
In the second test sample we cannot choose the fruits so as to follow Inna's principle.
//#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cmath> #include<stdlib.h> #include<map> #include<set> #include<time.h> #include<vector> #include<queue> #include<string> #include<string.h> #include<iostream> #include<algorithm> using namespace std; #define eps 1e-8 #define PI acos(-1.0) #define INF 0x3f3f3f3f #define LL long long #define max(a,b) ((a)>(b)?(a):(b)) #define min(a,b) ((a)<(b)?(a):(b)) typedef pair<int , int> pii; #define maxn 100 + 5 #define maxm 100000 + 5 int a[maxn], b[maxn]; int n, k; int d[2][maxm]; int main() { while(~scanf("%d%d", &n, &k)) { for(int i = 1; i <= n; i++) scanf("%d", a + i); for(int i = 1; i <= n; i++) scanf("%d", b + i); int M = 10000 * k ; for(int i = 1; i <= M; i++) d[0][i] = d[1][i] = -INF; d[0][0] = d[1][0] = 0; for(int i = 1; i <= n; i++) { int t = a[i] - k * b[i]; if(t >= 0) { for(int j = M; j >= t; j--) d[0][j] = max(d[0][j], d[0][j-t] + a[i]); } else { t = -t; for(int j = M; j >= t; j--) d[1][j] = max(d[1][j], d[1][j-t] + a[i]); } } int ans = -INF; for(int i = 0; i <= M; i++) ans = max(ans, d[0][i] + d[1][i]); if(ans == 0) ans = -1; printf("%d\n", ans); } return 0; }
相关文章推荐
- 黑马程序员——java复习总结——异常和包
- 堆和栈
- 面试题:字符串截取
- 程序人生的四个象限和两条主线
- Youtube最佳Red5 官方视频下载指南,字幕【亲测成功】
- 严格遵守“第一级DOM”能够让你避免与兼容性有关的任何问题
- 机房变迁--防火墙IP、访问控制更新
- 关于iOS内存管理
- 精通Hibernate——理解HibernateSession缓存
- TCP/IP网络编程 学习笔记_9 --域名系统(DNS)
- TCP/IP网络编程 学习笔记_9 --域名系统(DNS)
- 总结快速编程
- NOIP2012 day2 T3 疫情控制
- Android 进阶 教你打造 Android 中的 IOC 框架 【ViewInject】 (下) .
- $.ajax()方法进行网页间传值
- iOS开发-Day22-OC 延展和协议以及深浅复制
- SmartUpload的基本使用、相关控制及IP随机文件命名
- 费波纳契数d动态规划实现
- python函数——根据经纬度计算距离公式的错误及修正
- myeclipse,eclipse 在 debug 模式下 启动慢