Bone Collector
Time limit:2000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)
Total submission (s): 40414 Accepted Submission (s): 16794
Problem Descriptionmany years ago, in Teddy ' s hometown there is a man who was called "Bone Collector". Collect varies of bones, such as dog ' s, cow ' s, also he went to the grave ...
The bone collector had a big bag with a volume of V, and along he trip of collecting there is a lot of bones, obviously , different bone have different value and different volume, now given the each bone's value along his trips, can you CALCU Late out the maximum of the total value the bone collector can get?
Inputthe first line contain a integer T, the number of cases.
Followed by T cases, each case three lines, the first line contain both integer n, V, (N <=, v <=) repr Esenting the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume for each bone.
Outputone integer per line representing the maximum of the total value (this number would be is less than 231).
Sample Input
15 101 2 3 4 55 4 3 2 1
Sample Output
14
Authorteddy
Sourcehdu 1st "Vegetable-birds Cup" programming Open Contest
Recommend
This is the time to start doing DP, smash him!
/*=============================================================================## Author:liangshu-cbam # # QQ : 756029571 # # School: Harbin Polytechnic University # # last modified:2015-08-28 19:18## filename:b.cpp## Description: # The people who is crazy enough to think they can change the world, is the ones who does! =============================================================================*/# #include <iostream># include<sstream> #include <algorithm> #include <cstdio> #include <string.h> #include < cctype> #include <string> #include <cmath> #include <vector> #include <stack> #include < queue> #include <map> #include <set>using namespace std;struct a{int val, v;} E[1011];int Main () {int T; int dp[1011]; cin>>t; int n, v; while (t--) {scanf ("%d%d", &n, &v); for (int i = 1; I <= n; i++) {scanf ("%d", &e[i].val); } for (int i = 1; I <= N; i++{scanf ("%d", &E[I].V); } memset (DP, 0, sizeof (DP)); for (int i = 1, i <= N; i++) {for (int V = v; V >= e[i].v; v--) {Dp[v] = max (Dp[v], DP[V-E[I].V] + e[i].val); }} printf ("%d\n", Dp[v]); } return 0; }
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
Hangzhou Electric HDU ACM Bone Collector (DP 01)