题解:经典贪心
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,now,tot;
struct cow{
int s,e;
}a[50005];
bool cmp(cow a,cow b){
return a.e<b.e;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i].s,&a[i].e);
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
{
if(now<=a[i].s)
now=a[i].e,tot++;
}
printf("%d\n",tot);
return 0;
}