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;
    }
    





  • 相关阅读:
    http delete 服务端拿不到body
    VUE 指定、获取DOM元素的自定义值
    delphi + redis 实现即时消息
    VUE 父组件、子组件图片链接
    【杂记】Linux 学习笔记
    【杂记】Oracle
    iOS 容易造成循环引用的三种场景
    NSNotificationCenter KVO KVC Delegate Block
    C语言和OC的区别? 面向对象和面向过程的区别?
    SDWebImage的实现原理
  • 原文地址:https://www.cnblogs.com/cyendra/p/3226332.html
Copyright © 2011-2022 走看看