背包—01

最新推荐文章于 2024-04-09 12:16:57 发布

小白菜si

最新推荐文章于 2024-04-09 12:16:57 发布

阅读量148

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/qq_40760163/article/details/81040481

版权

ACM 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

Input

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 <= 1000 , V <= 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.

Output

One integer per line representing the maximum of the total value (this number will be less than 231).

Sample Input

15 101 2 3 4 55 4 3 2 1

Sample Output

#include <iostream>
using namespace std;
 
int main()
{
int nCases;
int nPack, nMaxVolume;
int weight[1002], value[1002];
int record[1002];
    //freopen("input.txt", "r", stdin);
    scanf("%d", &nCases);
    while(nCases--)
    {
        memset(record, 0, sizeof(record));
        scanf("%d %d", &nPack, &nMaxVolume);
        for(int i=0; i<nPack; ++i)
            scanf("%d", &value[i]);
        for(int i=0; i<nPack; ++i)
            scanf("%d", &weight[i]);
        for(int i=0; i<nPack; ++i)
            for(int j=nMaxVolume; j>=weight[i]; --j)
            {
                if(record[j-weight[i]]+value[i] > record[j])
                    record[j] = record[j-weight[i]]+value[i];
            }
        printf("%d\n", record[nMaxVolume]);
    }
    return 0;
}
using namespace std;
 
int main()
{
int nCases;
int nPack, nMaxVolume;
int weight[1002], value[1002];
int record[1002];
    //freopen("input.txt", "r", stdin);
    scanf("%d", &nCases);
    while(nCases--)
    {
        memset(record, 0, sizeof(record));
        scanf("%d %d", &nPack, &nMaxVolume);
        for(int i=0; i<nPack; ++i)
            scanf("%d", &value[i]);
        for(int i=0; i<nPack; ++i)
            scanf("%d", &weight[i]);
        for(int i=0; i<nPack; ++i)
            for(int j=nMaxVolume; j>=weight[i]; --j)
            {
                if(record[j-weight[i]]+value[i] > record[j])
                    record[j] = record[j-weight[i]]+value[i];
            }
        printf("%d\n", record[nMaxVolume]);
    }
    return 0;
}