EXP1101 植树节

#include <bits/stdc++.h>
using namespace std;
long long arr[1000010];
int main() {
	freopen("planting.in", "r", stdin);
	freopen("planting.out", "w", stdout);
	long long n, maxNum = -1, cnt = -1;
	cin >> n;
	for (int i = 0; i < n; i++) {
		long long l, r;
		cin >> l >> r;
		arr[l]++;
		arr[r + 1]--;
		maxNum = max(max(l, r), maxNum);
	}
	for (int i = 1; i <= maxNum; i++) {
		arr[i] += arr[i - 1];
		cnt = max(arr[i], cnt);
	}
	cout << max(arr[0], cnt) << endl;
	return 0;
}