[codeforces366C]Dima and Salad

在一场关于制作水果沙拉的烹饪难题中,Inna必须从具有特定口味和热量的水果中选择,以达到预设的口味与热量比。本篇探讨如何运用01背包问题的算法解决这一挑战,确保情侣的幸福。

time limit per test : 1 second
memory limit per test : 256 megabytes

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)n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10)n,k(1n100,1k10). The second line of the input contains n integers a1, a2, ..., an(1 ≤ ai ≤ 100)a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100)a1,a2,...,an(1ai100) — the fruits’ tastes. The third line of the input contains n integers b1, b2, ..., bn(1 ≤ bi ≤ 100)b_1, b_2, ..., b_n (1 ≤ b_i ≤ 100)b1,b2,...,bn(1bi100) — the fruits’ calories. Fruit number i has taste ai and calories bib_ibi.

Output

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

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.

题意:
nnn个元素,第jjj个元素有两个性质aja_jajbjb_jbj,从中选出mmm个元素,使得在这里插入图片描述若不存在方案符合,则输出-1,否则输出最大的sigma(aia_iai)。

题解:
bjb_jbj设为aj−k∗bja_j-k*b_jajkbj
然后就是裸的01背包问题了
物品大小可能为负数,要用到map

#include<bits/stdc++.h>
#define LiangJiaJun main
#define POS(a,b) (a*10001+b)
using namespace std;
int n,k;
int a[104],b[104];
map<int,int>mert,val;
int w33ha(){
    map<int,int>::iterator it;
    mert.clear();
    val.clear();
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
        scanf("%d",&b[i]);
        b[i]=a[i]-k*b[i];
    }
    val[0]=0;
    for(int i=1;i<=n;i++){
        mert=val;
        for(it=mert.begin();it!=mert.end();it++){
            val[(it->first)+b[i]]=max(val[(it->first)+b[i]],(it->second)+a[i]);
        }
    }
    if(val[0]==0)puts("-1");
    else printf("%d\n",val[0]);
    return 0;
}
int LiangJiaJun(){
    while(scanf("%d%d",&n,&k)!=EOF)w33ha();
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值