CF 366 C. 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 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.

解題思路：給你一些水果，每個水果有口味值a[i]和卡路里值b[i]，求一個方案使得sigma(a[i])/sigma(b[i])==k的最大口味之和的值，如果沒有滿足題意的方案，輸出-1，把每個水果看成口味值爲a[i],耗費爲a[i]-k*b[i]的物品，轉化爲01揹包，這樣就是求dp[i][0]，但是耗費可能負值，所以把數組平移m=n*100個單位，最後求dp[n][m]

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<utility>
#define Inf (1<<30)
#define M 100005
using namespace std;
int dp[105][M<<1];
int main()
{
	int i,j,n,m,k,val[105],cost;
	while(~scanf("%d%d",&n,&k))
	{
		m=n*100;
		memset(dp,192,sizeof(dp));
		dp[0][m]=0;
		for(i=1;i<=n;i++)
			scanf("%d",val+i);
		for(i=1;i<=n;i++)
		{
			scanf("%d",&cost);
			cost=val[i]-k*cost;
			for(j=2*m;j>=0;j--)
				dp[i][j]=max(dp[i-1][j],dp[i-1][j-cost]+val[i]);
		}
		printf("%d\n",dp[n][m]?dp[n][m]:-1);
	}
	return 0;
}