HDU 4619

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
const int N = 2009;
bool vis[N];
int cx[N], cy[N], head[N], e, n;
struct node {
    int next, v;
} edge[N << 9];
inline void add_edge(const int &u, const int &v) {
    edge[e].v = v;
    edge[e].next = head[u];
    head[u] = e++;
}
int dfs(int u) {
    int i, v;
    for (i = head[u]; ~i; i = edge[i].next) {
        v = edge[i].v;
        if (!vis[v]) {
            vis[v] = 1;
            if (!cy[v] || dfs(cy[v])) {
                cy[v] = u;
                cx[u] = v;
                return 1;
            }
        }
    }
    return 0;
}
void solve(int n, int m) {
    int i, ans = 0;
    for (i = 1; i <= n; i++) {
        if (!cx[i]) {
            memset(vis, 0, sizeof(vis));
            ans += dfs(i);
        }
    }
    printf("%d\n", n + m - (ans));
}
pair<int, int> a[N], b[N];
bool inter(pair<int, int>& a, pair<int, int>& b) {
    if (a.first == b.first && a.second == b.second) {
        return true;
    }
    if (a.first == b.first && a.second == b.second + 1) {
        return true;
    }
    if (a.first + 1 == b.first && a.second == b.second) {
        return true;
    };
    if (a.first + 1 == b.first && a.second == b.second + 1) {
        return true;
    }
    return false;
}
int main() {
    int n, m, i, j;
    while (~scanf("%d%d", &n, &m) && (n | m)) {
        e = 0;
        memset(head, -1, sizeof(head));
        memset(cx, 0, sizeof(cx));
        memset(cy, 0, sizeof(cy));
        for (i = 1; i <= n; ++i) {
            scanf("%d%d", &a[i].first, &a[i].second);
        }
        for (i = 1; i <= m; ++i) {
            scanf("%d%d", &b[i].first, &b[i].second);
        }
        for (i = 1; i <= n; ++i) {
            for (j = 1; j <= m; ++j) {
                if (inter(a[i], b[j])) {
                    add_edge(i, n + j);
                    // cout<<"A "<<i<<" "<<j<<endl;
                    //  printf("%d %d\n",a[i].first,a[i].second);
                    //  printf("%d %d\n",b[j].first,b[j].second);
                }
            }
        }
        solve(n, m);
    }
    return 0;
}