#include<bits/stdc++.h>
using namespace std;
int n,m,sum,zj,y,g,j,cs,d;//n数量, m距离 
int jl[10002],jg[10002];
int main(){
    //freopen("road.in","r",stdin);
	//freopen("road.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n-1;i++){
		cin>>jl[i];
	}
	for(int i=1;i<=n;i++){
		cin>>jg[i];
		if(i==n) jg[i]=1010;
	}
	for(int k=1;k<=n;k++){
		if(cs!=0) k+=cs-1;
		cs=0;
		d=0;
		for(int i=1;;i++){
		//	cout<<jg[k]<<" "<<jg[k+d]<<endl;
			if(jg[k]<=jg[k+d]){
				sum+=jl[d+k];
				d++;
		//		cout<<sum<<endl; 
				cs++;
			}else{
			//	cout<<"sum="<<sum<<" "<<"y="<<y<<endl; 
				g=sum-y;
			//	cout<<"g="<<" "<<g<<endl; 
				sum=((sum-y-1)/m)+1;
			//	cout<<"sum="<<" "<<sum<<endl;
				y=sum*m-g;
			//	cout<<"y="<<" "<<y<<endl;
				zj+=sum*jg[k];
				sum=0;
			//	cout<<" "<<zj<<" "<<y<<endl;
				break; 
			
		}
		
	}
	}
	
	cout<<zj;
	return 0;
} 

同学代码RE+WA

0分

帮帮忙看一下