<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to 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 his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get
 
</blockquote>
<h2 id="input">Input</h2>
<blockquote>
The first line contain a integer T , the number of cases. 
Followed by T cases , each case three lines , the first line contain two integer N , V, (N &lt;= 1000 , V &lt;= 1000 )representing 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 of each bone.
</blockquote>
<h2 id="output">Output</h2>
<blockquote>
One integer per line representing the maximum of the total value (this number will be less than 231).
</blockquote>
<h2 id="sample-input">Sample Input</h2>
<blockquote>
1 
5 10 
1 2 3 4 5 
5 4 3 2 1
</blockquote>
<h2 id="sample-output">Sample Output</h2>
<blockquote>
14
</blockquote>
</blockquote>
<h1 id="heading-1">翻译</h1>
<blockquote>
<h2 id="heading-2">描述</h2>
<blockquote>
很多年前,在 Teddy 的家乡有一个“集骨者”的传说 
“集骨者”会收集各种各样的骨头,狗、牛……他甚至会进入坟墓来获取骨头 
“集骨者”有一个容量为 <code>V</code> 的背包,显然在他的旅行中,这就是他放骨头的地方 
不同的骨头价值不同,体积也不同,现在给你每一个骨头的价值和体积,你能计算出在容量许可范围能,最多能收集多大价值的骨头么?
</blockquote>
<h2 id="heading-3">输入</h2>
<blockquote>
第一行是 <code>T</code> 数据组数 
每组数据有一个 <code>N</code> 、 <code>V</code> ( <code>N</code> &lt;= 1000, <code>V</code> &lt;= 1000)分别是骨头的数量和背包的最大容量 
接下来一行有 <code>N</code> 个整数,表示骨头的价值 
下面一行也有 <code>N</code> 个整数,表示骨头的体积
</blockquote>
<h2 id="heading-4">输出</h2>
<blockquote>
一行不超过232的整数
</blockquote>
</blockquote>
<h1 id="heading-5">题解</h1>
标准的<a href="/post/Algorithm/Package_Problem.html#01%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98">&gt;背包问题 - 01背包问题&lt;</a>
标准到不能更标准的01背包问题
<h1 id="heading-6">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
Blog:http://www.oyohyee.com/
Email:oyohyee@oyohyee.com

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
#include &lt;set&gt;
#include &lt;functional&gt;
using namespace std;

const int maxn = 1005;

int v,n;
int dp[maxn];
int value[maxn];
int vol[maxn];

void ZeroOnePack(int cost,int weight) {
 for(int i = v; i &gt;= cost; i--)
 dp[i] = max(dp[i],dp[i - cost] + weight);
}


void Do() {
 scanf(&#34;%d%d&#34;,&amp;n,&amp;v);

 for(int i = 1;i &lt;= n;i++)
 scanf(&#34;%d&#34;,&amp;value[i]);
 for(int i = 1;i &lt;= n;i++)
 scanf(&#34;%d&#34;,&amp;vol[i]);
 memset(dp,0,sizeof(dp));
 for(int i = 1;i &lt;= n;i++)
 ZeroOnePack(vol[i],value[i]);

 printf(&#34;%d\n&#34;,dp[v]);

}


int main() {
 int T;
 scanf(&#34;%d&#34;,&amp;T);
 while(T--)
 Do();
 return 0;
}
</pre>

HDU 2602.Bone Collector