-
贪心模板
-
link<----板子链接
#include<iostream>
#include<algorithm>
using namespace std;
typedef pair<int,int> PP;
const int N=1e5+10;
#define f first
#define s second
PP node[N];
bool cmp(PP a,PP b)
{
return a.s<b.s;
}
int main()
{
int n;cin>>n;
for(int i=0;i<n;i++)
{
cin>>node[i].f>>node[i].s;
}
sort(node,node+n,cmp);
int res=0,end=-0x3f3f3f3f;
for(int i=0;i<n;i++)
{
if(node[i].f>end)
{
res++;
end=node[i].s;
}
}
cout<<res<<endl;
return 0;
}