#include<iostream> #include<vector> #include<algorithm> #include<tuple> #include<cmath> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); vector<tuple<long long,long long,long long>> num; int n; cin>>n; for(int i=0;i<n;i++) { int a; cin>>a; num.emplace_back(make_tuple(a, 0, 0)); } for(int i=0;i<n;i++) { int a; cin>>a; get<1>(num[i])=a; } for(int i=0;i<n;i++) { int a; cin>>a; get<2>(num[i])=a; } sort(num.begin(), num.end(), [](const tuple<long long,long long,long long>& a, const tuple<long long,long long,long long>& b) { return get<0>(a) < get<0>(b); });//排序，小到大 long long right=num.size()-1; vector<long long>sum(n); for(int i=0;i<n;i++) { sum[i]=get<2>(num[i]); if(i) { sum[i]+=sum[i-1]; } } long long max1=0; long long countv=0; for(int i=0;i<n;i++) { long long temp=get<0>(num[i]);//坐标值 long long r =get<1>(num[i]);//半径 //范围太大，二分查找,找到两个边界值范围 long long left=0; right=num.size()-1; long long R1=temp-r; long long R2=temp+r; while(left < right)//找最右边值范围 { long long mid = (right+left)/2; if(get<0>(num[mid])>=R2) { right=mid; } else { left=mid+1; } } long long max1 = left; left=0; right=num.size()-1; while(left < right)//找最左边值范围 { long long mid = (right+left)/2; if(get<0>(num[mid])>=R1) { right=mid; } else { left=mid+1; } } long long min = left; if(get<0>(num[max1])>R2) { max1--; } countv=max(countv,sum[max1]-sum[min-1]); } cout<<countv<<endl; return 0; }