#include<bits/stdc++.h>
#define int long long
using namespace std;
const int Max=1e6+5;
struct node{
	int l,r,s,t,rk;
}p[Max],p2[Max];
int dp[Max];

struct Tree{
	struct node{
		int Max;
	}p[Max*4];
	void pushup(int now)
	{
		p[now].Max=max(p[now<<1].Max,p[now<<1|1].Max);
	}
	void update(int now,int l,int r,int loc,int num)
	{
		if(l==r)
		{
			p[now].Max=max(p[now].Max,num);
			return ;
		}
		int mid=(l+r)>>1;
		if(loc<=mid)
			update(now<<1,l,mid,loc,num);
		else
			update(now<<1|1,mid+1,r,loc,num);
		pushup(now);
	}
	int query(int now,int l,int r,int nl,int nr)
	{
		if(l<=nl and nr<=r)
			return p[now].Max;
		int mid=(nl+nr)>>1,ans=-0x7fffffff;
		if(l<=mid)
			ans=max(ans,query(now<<1,l,r,nl,mid));
		if(mid<r)
			ans=max(ans,query(now<<1|1,l,r,mid+1,nr));
		return ans;
	}
}T;

int n;
signed main()
{
	scanf("%lld",&n);
	int in;
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&p[i].t);
		p[i].l=i-p[i].t;
		p[i].r=i+p[i].t;
		p[i].rk=i;
	}
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&in);
		p[i].s=p[i].t*in;
		p2[i]=p[i];
	}
	sort(p+1,p+1+n,[](node A,node B){return A.r<B.r;});
	int ans=0,now=1;
	
	for(int i=1;i<=n;i++)
	{
		while(now<=n and p[now].r<=i)
			T.update(1,1,n,p[now].rk,dp[p[now].rk]),now++;
		if(p2[i].l<=0)
			dp[i]=p2[i].s;
		else
		{
			dp[i]=p2[i].s+T.query(1,1,p2[i].l,1,n);
		}
		ans=max(ans,dp[i]);
	}
	printf("%lld",ans);
}

answer.code: In function 'int main()':
answer.code:63:50: warning: lambda expressions only available with -std=c++11 or -std=gnu++11 [enabled by default]
  sort(p+1,p+1+n,[](node A,node B){return A.r<B.r;});\x0d
                                                  ^
answer.code:63:51: error: no matching function for call to 'sort(node*, node*, main()::__lambda0)'
  sort(p+1,p+1+n,[](node A,node B){return A.r<B.r;});\x0d
                                                   ^
answer.code:63:51: note: candida...