整数区间问题
#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct node {
int l, r;
}a[1001];
bool cmp(node A, node B) {
return A.r < B.r;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i].l >> a[i].r;
sort(a + 1, a + n + 1, cmp);
int tmp = 1, ans = 1;
for (int i = 2; i <= n; i++) {
if (a[tmp].r >= a[i].l)continue;
else {
tmp = i;
ans++;
}
}
cout << ans << endl;
return 0;
}