• D


    A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example, 

    N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10 

    means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each. 

    Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine. 

    Notes: 
    @ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc. 

    Input

    The program input is from standard input. Each data set in the input stands for a particular transaction and has the format: 

    cash N n1 D1 n2 D2 ... nN DN 

    where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct. 

    Output

    For each set of data the program prints the result to the standard output on a separate line as shown in the examples below. 

    Sample Input

    735 3  4 125  6 5  3 350
    633 4  500 30  6 100  1 5  0 1
    735 0
    0 3  10 100  10 50  10 10

    Sample Output

    735
    630
    0
    0

    Hint

    The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash. 

    In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash. 

    In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.

    模板题

    记录代码

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<vector>
    #include<iostream>
    #include<set>
    using namespace std;
    int va[15];
    int num[15];
    int dp[100005];
    int main()
    {
        int v;
        int n;
        while(~scanf("%d%d",&v,&n))
        {
            memset(dp,0,sizeof(dp));
            for(int i=1; i<=n; i++)
            {
                scanf("%d",&num[i]);
                scanf("%d",&va[i]);
            }
            dp[0]=1;
            for(int i=1; i<=n; ++i)
            {
                if(num[i]*va[i]<v)
                {
                    for(int k=1; k<=num[i]; k*=2)
                    {
                        for(int j=v; j>=0; j--)
                        {
                            if(va[i]*k<=j) dp[j]=max(dp[j-k*va[i]],dp[j]);
                        }
                        num[i]-=k;
                    }
                    for(int j=v; j>=0; j--)
                    {
                        if(va[i]*num[i]<=j) dp[j]=max(dp[j-num[i]*va[i]],dp[j]);
                    }
                }
                else
                {
                    for(int j=0; j<=v; j++)
                    {
                        if(j>=va[i]) dp[j]=max(dp[j-va[i]],dp[j]);
                    }
                }
            }
            int ans=0;
            for(int i=1; i<=v; i++)
            {
                if(dp[i]) ans=i;
            }
            printf("%d
    ",ans);
        }
    }
    
  • 相关阅读:
    P1903 [国家集训队]数颜色 / 维护队列 莫对算法
    P1016 旅行家的预算 模拟 贪心
    P3948 数据结构 差分数组
    乘法逆元 模板
    二分法 最大化平均值
    HDU5213 Lucky 莫队算法 容斥定理
    P1083 借教室 差分数组
    发布订阅、redis的配置文件、redis的主从、redis的持久化、
    nosql、redis、性能测试、命令相关、redis的数据类型string、list、hash、set、zset、
    nginx的日志、禁止访问、反向代理、权重、nginx location匹配规则、location分离、WSGI、
  • 原文地址:https://www.cnblogs.com/caowenbo/p/11852326.html
Copyright © 2020-2023  润新知