#include<bits/stdc++.h>
using namespace std;
struct shijian {
int b,e;
}s[1000];
int compare (shijian b,shijian a) {
return b.e<a.e;
}
int main() {
int n,i,t;
int sum;
while(scanf("%d",&n)!=EOF&&n!=0) {
for(i=0;i<n;i++)
scanf("%d %d",&s[i].b,&s[i].e);
sort(s,s+n,compare);
sum=1;t=s[0].e;
for(i=1;i<n;i++)
if(s[i].b>=t)
sum++,t=s[i].e;
printf("%d\n",sum);
}
return 0;
}
hdu 2037 今年暑假不AC
最新推荐文章于 2022-02-01 22:17:13 发布