Old Peykan--codeForces 241A--动态规划

Description

There are n cities in the country where the Old Peykan lives. These cities are located on a straight line, we'll denote them from left to right as c₁, c₂, ..., c_n. The Old Peykan wants to travel from city c₁ to c_n using roads. There are (n - 1) one way roads, the i-th road goes from city c_i to city c_i + 1 and is d_i kilometers long.

The Old Peykan travels 1 kilometer in 1 hour and consumes 1 liter of fuel during this time.

Each city c_i (except for the last city c_n) has a supply of s_i liters of fuel which immediately transfers to the Old Peykan if it passes the city or stays in it. This supply refreshes instantly k hours after it transfers. The Old Peykan can stay in a city for a while and fill its fuel tank many times.

Initially (at time zero) the Old Peykan is at city c₁ and s₁ liters of fuel is transferred to it's empty tank from c₁'s supply. The Old Peykan's fuel tank capacity is unlimited. Old Peykan can not continue its travel if its tank is emptied strictly between two cities.

Find the minimum time the Old Peykan needs to reach city c_n.

Input

The first line of the input contains two space-separated integers m and k (1 ≤ m, k ≤ 1000). The value m specifies the number of roads between cities which is equal to n - 1.

The next line contains m space-separated integers d₁, d₂, ..., d_m (1 ≤ d_i ≤ 1000) and the following line contains m space-separated integers s₁, s₂, ..., s_m (1 ≤ s_i ≤ 1000).

Output

In the only line of the output print a single integer — the minimum time required for The Old Peykan to reach city c_n from city c₁.

Sample Input

Input

4 6
1 2 5 2
2 3 3 4

Output

10

Input

2 3
5 6
5 5

Output

14

#include <iostream>
#include <cstdio>
using namespace std;
int value[1008];//用来存到达某个城市的汽油（冲了油后）
int dp[1008];//用来存到达某个城市的最短时间
int dis[1008];//用来存路长度
int s[1008];//用来存每个城市能冲的油
//总体来说，此题是一道贪心的动态规划，如果能到达，就到达。。如果不能到达的话，就在能供油最多的城市多逗留一下
int maxs[1008];//用来存前几个城市供油最多的是哪个城市
int main()
{
	int n,k;//n是路的数目，k是几小时后就能恢复供油
	while(scanf("%d%d",&n,&k)==2)
	{
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&dis[i]);
		}//dis[i]即城市i+1到城市i的距离
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&s[i]);
		}
		maxs[1]=s[1];
		int maxxs=s[1];
		for(int i=2;i<=n;i++)
		{
			if(s[i]>maxxs)
			{
				maxs[i]=s[i];
				maxxs=s[i];
			}
			else maxs[i]=maxxs;
		}
		dp[1]=0;
		value[1]=s[1];
		for(int i=2;i<=n;i++)
		{
			if(value[i-1]>=dis[i-1])
			{
				dp[i]=dp[i-1]+dis[i-1];
				value[i]=value[i-1]-dis[i-1]+s[i];
			}
			else
			{
				while(value[i-1]<dis[i-1])
				{
					value[i-1]+=maxs[i-1];
					dp[i-1]+=k;
				}
				dp[i]=dp[i-1]+dis[i-1];
				value[i]=value[i-1]-dis[i-1]+s[i];
			}
		}
		while(value[n]<dis[n])
		{
			value[n]+=maxs[n];
			dp[n]+=k;
		}
		dp[n+1]=dp[n]+dis[n];
		cout<<dp[n+1]<<endl;
	}
	return 0;
}