CSP-J2023复赛T2

#include <bits/stdc++.h>
using namespace std;
const int N=100005;
int n,d,i,a[N],v[N];
long long q,ans,distmp;
int main() {
	scanf("%d%d",&n,&d);
	for(i=1;i<n;i++)
		scanf("%d",&a[i]);
	for(i=1;i<=n;i++)
		scanf("%d",&v[i]);
	for(i=2;i<=n;i++) 
		if(v[i]>v[i-1])
			v[i]=v[i-1];
	for(i=1;i<n;i++) {
		int dis=a[i]-distmp;
		if(dis<0) {
			distmp=-dis;
			continue;
		}
		if(dis%d==0) 
			q=dis/d;
		else q=dis/d+1;
		ans+=q*v[i];
		distmp=q*d-a[i];
	}
	printf("%lld",ans);
	return 0;
}