提交时间:2025-12-19 22:30:41
运行 ID: 76823
#include <bits/stdc++.h> using namespace std; int l, m, u, v, sum; bool has[10010]; int main() { cin >> l >> m; fill(has, has + l + 1, true); for(int i = 1; i <= m; i++) { cin >> u >> v; for(int j = u; j <= v; j++) has[j] = false; } for(int i = 0; i <= l; i++) sum += has[i]; cout << sum; return 0; }