代码:
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 2001;
int a[N], b[N], c[N], d[N];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i] >> d[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int t = min(b[i], d[j]) - max(a[i], c[j]);
ans += max(t, 0);
}
}
cout << ans << endl;
return 0;
}