/贪心吧/
include[HTML_REMOVED]
define rep(i, a, n) for(int i=a; i<=n; i++)
define int long long
using namespace std;
const int maxn = 1e3;
struct Node {
int l, r;
} a[maxn];
int cmp(Node a, Node b) {
return a.l < b.l;
}
signed main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
rep(i, 1, m) cin >> a[i].l >> a[i].r;
sort(a+1, a+1+m, cmp);
int sum = 0;
int ans = -1;
rep(i, 1, m) {
if(a[i].l > ans) {
sum += a[i].r - a[i].l + 1;
ans = a[i].r;
} else if(a[i].r > ans){
sum += a[i].r - ans;
ans = a[i].r;
}
}
cout << n - sum + 1 << endl;
}
[HTML_REMOVED]
兄弟,你重新弄一下排版吧!