#include using namespace std; long maximumPeople(vector p, vector x, vector y, vector r) { int m=y.size(); int n=p.size(); int i=0,j=0; long int sum=0,max=0,k; while(j=y[j]-r[j] && x[i]<=y[j]+r[j]) { k=1; if(p[i]>max) { if(x[i]>=y[j+1]-r[j+1] && x[i]<=y[j+1]+r[j+1]) int z=0; else max=p[i]; } j++; } else { if(k!=1) sum+=x[i]; else k=0; i++; } } if(i> n; vector p(n); for(int p_i = 0; p_i < n; p_i++){ cin >> p[p_i]; } vector x(n); for(int x_i = 0; x_i < n; x_i++){ cin >> x[x_i]; } int m; cin >> m; vector y(m); for(int y_i = 0; y_i < m; y_i++){ cin >> y[y_i]; } vector r(m); for(int r_i = 0; r_i < m; r_i++){ cin >> r[r_i]; } long result = maximumPeople(p, x, y, r); cout << result << endl; return 0; }