zoukankan      html  css  js  c++  java
  • UVa 10130 SuperSale 背包

    SuperSale

    There is a SuperSale in a SuperHiperMarket. Every person can take only one object of each kind, i.e. one TV, one carrot, but for extra low price. We are going with a whole family to that SuperHiperMarket. Every person can take as many objects, as he/she can carry out from the SuperSale. We have given list of objects with prices and their weight. We also know, what is the maximum weight that every person can stand. What is the maximal value of objects we can buy at SuperSale?

    Input Specification

    The input consists of T test cases. The number of them (1<=T<=1000) is given on the first line of the input file.

    Each test case begins with a line containing a single integer number that indicates the number of objects (1 <= N <= 1000). Then follows Nlines, each containing two integers: P and W. The first integer (1<=P<=100) corresponds to the price of object. The second  integer (1<=W<=30) corresponds to the weight of object. Next line contains one integer (1<=G<=100)  it’s the number of people in our group. Next G lines contains maximal weight (1<=MW<=30) that can stand this i-th person from our family (1<=i<=G).

    Output Specification

    For every test case your program has to determine one integer. Print out the maximal value of goods which we can buy with that family.

    Sample Input

    2

    3

    72 17

    44 23

    31 24

    1

    26

    6

    64 26

    85 22

    52 4

    99 18

    39 13

    54 9

    4

    23

    20

    20

    26

    Output for the Sample Input

    72

    514

    -------------

    orz 物品居然可以随便取,水了。

    --------------

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    
    using namespace std;
    
    int f[33333];
    int w[1111];
    int v[1111];
    int n;
    int m;
    
    int main()
    {
        int T;
        scanf("%d",&T);
        while (T--)
        {
            memset(f,0,sizeof(f));
            memset(w,0,sizeof(w));
            memset(v,0,sizeof(v));
            m=0;
            scanf("%d",&n);
            for (int i=1;i<=n;i++)
            {
                scanf("%d%d",&v[i],&w[i]);
                m+=w[i];
            }
            for (int i=1;i<=n;i++)
            {
                for (int j=m;j>=w[i];j--)
                {
                    f[j]=max(f[j],f[j-w[i]]+v[i]);
                }
            }
            int G,MV;
            int ans=0;
            scanf("%d",&G);
            while (G--)
            {
                scanf("%d",&MV);
                ans+=f[MV];
            }
            printf("%d\n",ans);
        }
        return 0;
    }
    





  • 相关阅读:
    剑指 Offer 22. 链表中倒数第k个节点
    剑指 Offer 21. 调整数组顺序使奇数位于偶数前面
    Leetcode1450. 在既定时间做作业的学生人数
    Leetcode1572. 矩阵对角线元素的和
    Leetcode 1480. 一维数组的动态和
    Idea连接数据库报错
    Java实现二叉树层次遍历并存入List的方法:从上往下,从左往右
    SpringCloud资源网站
    Java循环对list进行remove
    Java中字符串判空的正确打开方式
  • 原文地址:https://www.cnblogs.com/cyendra/p/3226332.html
Copyright © 2011-2022 走看看