#include<cstdio>
#include<algorithm>

inline int max(const int &a, const int &b) {return a > b ? a : b;}

struct Node {
    Node *LS, *RS;
    int Sum, Mxl, Mxr, Mx;
    void update() {
        Sum = LS->Sum + RS->Sum;
        Mxl = max(LS->Mxl, LS->Sum + RS->Mxl);
        Mxr = max(RS->Mxr, RS->Sum + LS->Mxr);
        Mx = max(LS->Mxr + RS->Mxl, max(LS->Mx, RS->Mx));
    }
    void Modify(int l, int r, int x, int c) {
        if(l == r) {
            Sum += c;
            Mxl += c;
            Mxr += c;
            Mx += c;
            return;
        }
        int mid = (l + r) >> 1;
        if(x <= mid) LS->Modify(l, mid, x, c);
        else RS->Modify(mid + 1, r, x, c);
        update();
    }
} tr[4005], *Cnt = tr;

void build(Node* x, int l, int r) {
    x->Mx = x->Mxl = x->Mxr = x->Sum = 0;
    if(l == r) return;
    int mid = (l + r) >> 1;
    build(x->LS = ++Cnt, l, mid);
    build(x->RS = ++Cnt, mid + 1, r);
}

struct Point {
    int x, y, val;
} p[2005];
int n, m, ans = -2147483647, A, B;
int x[2005], y[2005];

int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) scanf("%d%d", &x[i], &y[i]);
    scanf("%d", &m);
    for(int i = n + 1; i <= n + m; ++i) scanf("%d%d", &x[i], &y[i]);
    scanf("%d%d", &A, &B);
    for(int i = 1; i <= n + m; ++i) p[i] = {x[i], y[i], i <= n ? A : -B};
    std::sort(p + 1, p + n + m + 1, [](Point &a, Point &b) {
        return a.y == b.y ? a.x < b.x : a.y < b.y;
    });
    std::sort(x + 1, x + n + m + 1);
    std::sort(y + 1, y + n + m + 1);
    int totx = std::unique(x + 1, x + n + m + 1) - x - 1;
    int toty = std::unique(y + 1, y + n + m + 1) - y - 1;
    for(int i = 1; i <= n + m; ++i) {
        p[i].x = std::lower_bound(x + 1, x + totx + 1, p[i].x) - x;
        p[i].y = std::lower_bound(y + 1, y + toty + 1, p[i].y) - y;
    }
    for(int d = 1; d <= toty; ++d) {
        int now = 1;
        build(tr, 1, totx);
        while(p[now].y < d && now <= n + m) ++now;
        for(int u = d; u <= toty; ++u) {
            while(p[now].y <= u && now <= n + m) {
                tr->Modify(1, totx, p[now].x, p[now].val);
                ++now;
            }
            ans = max(ans, tr->Mx);
        }
    }
    printf("%d\n", ans);
    return 0;
}

在某些数据的时候不会报

以下为报错数据