很多人都是的50分求大神解答

#include<bits/stdc++.h>
using namespace std;
long long n,k,nn,yo,lc,pr;
long long s1[100010],v[100010],a[100010],ne[100010],s2[100010];
long long ans;
int main()
{
	//freopen("road10.in","r",stdin);
	//freopen("road10.out","w",stdout);
	cin>>n>>k;
	for(long long i=1;i<=n-1;i++){
		cin>>v[i];
	}
	for(long long i=1;i<=n;i++){
		cin>>a[i];
	}
	//cout<<11111111ll;
	for(int i=1;i<n;i++){
		s1[i]=s1[i-1]+v[i];
	}
	
	//(int i=1;i<=n;i++){
		//s2[i]=s2[i-1]+a[i];
	//}
	for(int i=1;i<n;){
		int ii=i;
		for(int j=i+1;j<=n;j++){
			if(a[j]<a[i]){
				ne[i]=j;
				i=j;break;
			}
			
			}
			if(ne[ii]==0){
				
				ne[ii]=n;
				
				break;
			}
		ii=i;
		//Find the middle errors
		
	}
	//for(int i=1;i<n;i++)cout<<ne[i]<<' ';// At least it's right behind here
	int mm=1;
	for(;;){
				nn=ne[mm];//jl is right
				if(!nn)break;
				int jl=s1[nn-1]-s1[mm-1];
				int dy=((jl-yo)%k>=1);
				lc=(jl-yo)/k+dy;
				pr=lc*a[mm];
				yo=(lc*k+yo)-jl;
				ans+=pr;
				mm=nn;
				//cout<<pr<<' ';
		}
	cout<<ans<<endl;
	return 0;
}