@[chenjieyang](/user/663693) 求关注～
```cpp
#include <iostream>
#include <algorithm>
using namespace std;
struct Inv
{
int begin, end;
};
Inv c[1000005];
bool cmp(Inv x, Inv y)
{
return x.end < y.end;
}
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> c[i].begin >> c[i].end;
}
sort(c + 1, c + n + 1, cmp);
int ans = 1;
int pik = c[1].end;
for (int i = 2; i <= n; i++)
{
if (c[i].begin >= pik)
{
ans++;
pik = c[i].end;
}
else
{
continue;
}
}
cout << ans << endl;
return 0;
}
```
by JustinXiaoJunyang @ 2022-08-24 19:05:34
@[JustinXiaoJunyang](/user/397137)
谢谢
by chenjieyang @ 2022-08-24 19:18:35