CF 366C. Dima and Salad

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 integers a1, 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.

这题其实可以转化为0/1背包，令bi=ai-k×bi, 就是sigma(b[i])=0，sigma(a[i])最大。

注意b[i]>=0和b[i]<0递推方向相反。

 水背包， 把a[i]-b[i]*k当做一个物品， 物品重量有负数， 我们假定初始状态为dp[d] = 0(d = 100000), 那么重量为负数也可以转移， 最后在dp[d]里面找值

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define inf 0x3f3f3f3f
const int maxm=50000;
int n,m,k;
int dp[maxm<<2];
int a[333],b[333];


int main()
{
    cin>>n>>k;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)
    {
        cin>>b[i];
        b[i]=a[i]-b[i]*k;
    }
    memset(dp,-1,sizeof dp);
    dp[maxm/2]=0;
    for(int i=0;i<n;i++)
    {
        if(b[i]>=0)
        {
            for(int j=maxm;j>=b[i];j--)
                if(~dp[j-b[i]])
                dp[j]=max(dp[j],dp[j-b[i]]+a[i]);
        }
        else{
            for(int j=0;j<=maxm+b[i];j++)
                if(~dp[j-b[i]])
                dp[j]=max(dp[j],dp[j-b[i]]+a[i]);
        }
    }
    int ans=dp[maxm/2];
    if(ans==0)ans=-1;
    cout<<ans<<endl;
}