#include #include #include #include #include #include #include int main() { int n; int max=0,sum=0; scanf("%i", &n); long int *townpop = malloc(sizeof(long int) * n); for (int p_i = 0; p_i < n; p_i++) { scanf("%li",&townpop[p_i]); } long int *loc = malloc(sizeof(long int) * n); for (int x_i = 0; x_i < n; x_i++) { scanf("%li",&loc[x_i]); } int m; scanf("%i", &m); long int *y = malloc(sizeof(long int) * m); for (int y_i = 0; y_i < m; y_i++) { scanf("%li",&y[y_i]); } long int *r = malloc(sizeof(long int) * m); for (int r_i = 0; r_i < m; r_i++) { scanf("%li",&r[r_i]); } for(int i=0;i=(y[j]-r[j])) { if(townpop[i] > max) max=townpop[i]; } else sum+=townpop[i]; } } printf("%d",(sum+max)); return 0; }