-j T2 85 求调

#include<bits/stdc++.h>
using namespace std;
int n,d,now_r,now_p;
struct node{
	int p,v,ans;
}a[100005];
int ceil(int a,int b){
	if(a%b==0)
		return a/b;
	else return a/b+1;
}
int main(){
	//freopen("road.in","r",stdin);
	//freopen("road.out","w",stdout);
	cin>>n>>d;
	for(int i=1;i<n;i++)cin>>a[i].v;
	for(int i=1;i<=n;i++)cin>>a[i].p;
	for(int i=1;i<=n;i++){
		if(a[i].ans!=-1){
			for(int j=i+1;j<=n;j++){
				if(a[i].p<a[j].p){
					a[j].ans=-1;
					a[i].ans+=a[j].v;
				}
				else break;
			}
			a[i].ans+=a[i].v;
		}
	}
	for(int i=1;i<n;i++){
		if(a[i].ans!=-1){
			int shop=ceil((a[i].ans-now_r),d);
			int price=shop*a[i].p;
			now_p+=price;
			now_r+=shop*d;
		}
		now_r-=a[i].v;
	}
	cout<<now_p;
	return 0;
}