zoukankan      html  css  js  c++  java
  • CF Dima and Salad 01背包

    C. Dima and Salad
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Dima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.

    Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k. In other words,  , where aj is the taste of the j-th chosen fruit and bj is its calories.

    Inna hasn't chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!

    Inna loves Dima very much so she wants to make the salad from at least one fruit.

    Input

    The first line of the input contains two integers n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10). The second line of the input contains n integersa1, a2, ..., an (1 ≤ ai ≤ 100) — the fruits' tastes. The third line of the input contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 100) — the fruits' calories. Fruit number i has taste ai and calories bi.

    Output

    If there is no way Inna can choose the fruits for the salad, print in the single line number -1. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.

    Sample test(s)
    input
    3 2
    
    10 8 1
    2 7 1
    output
    18
    input
    5 3
    
    4 4 4 4 4
    2 2 2 2 2
    output
    -1
    Note

    In the first test sample we can get the total taste of the fruits equal to 18 if we choose fruit number 1 and fruit number 2, then the total calories will equal 9. The condition  fulfills, that's exactly what Inna wants.

    In the second test sample we cannot choose the fruits so as to follow Inna's principle.

     

     

     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<stdlib.h>
     4 int INF =100000000;
     5 
     6 int dp1[100003];
     7 int dp2[100003];
     8 int a[103];
     9 int b[103];
    10 int Max(int x,int y)
    11 {
    12     return x>y? x:y;
    13 }
    14 void solve(int n,int m)
    15 {
    16     int i,j,k,hxl=-1;
    17     for(i=1;i<=n;i++)
    18     {
    19         k=a[i]-b[i]*m;
    20         if(k>0)
    21         {
    22             for(j=100000;j>=k;j--)
    23             {
    24                 dp1[j]=Max(dp1[j],dp1[j-k]+a[i]);
    25             }
    26         }
    27         else
    28         {
    29             for(j=100000;j>=-k;j--)
    30             {
    31                 dp2[j]=Max(dp2[j],dp2[j+k]+a[i]);
    32             }
    33         }
    34     }
    35     for(j=100000;j>=0;j--)
    36     {
    37         k=dp1[j]+dp2[j];
    38         if(k>hxl)
    39             hxl=k;
    40     }
    41     if(hxl==0)printf("-1
    ");
    42     else printf("%d
    ",hxl);
    43 }
    44 int main()
    45 {
    46     int n,m;
    47     int i;
    48     while(scanf("%d%d",&n,&m)>0)
    49     {
    50         for(i=1;i<=n;i++)
    51             scanf("%d",&a[i]);
    52         for(i=1;i<=n;i++)
    53             scanf("%d",&b[i]);
    54         for(i=100000;i>=0;i--)
    55         {
    56             dp1[i]=-INF;
    57             dp2[i]=-INF;
    58         }
    59         dp1[0]=0;
    60         dp2[0]=0;
    61         solve(n,m);
    62     }
    63     return 0;
    64 }
  • 相关阅读:
    烂泥:KVM使用NAT联网并为VM配置iptables端口转发
    烂泥:CentOS6.5挂载windows共享文件夹
    烂泥:KVM、kickstart与FTP集成
    js-浅显基础-正则表达式集
    小程序-轮播图案例
    小程序-TabBar点击切换
    js-禁止微信内置浏览器调整字体大小
    小程序-分享到群或好友
    小程序-提交信息(姓名,电话)
    js-在url后面添加时间戳清除浏览器打开页面的缓存
  • 原文地址:https://www.cnblogs.com/tom987690183/p/3443334.html
Copyright © 2011-2022 走看看