2037今年暑假不AC

#include <iostream>
#include <cstdio>
#include<algorithm>
using namespace std;
struct inp{
int x,y;
}node[101];
int cmp(inp a,inp b){
return a.y<b.y;
}
int main()
{
int n,i,j,s;
while(scanf("%d",&n)!=EOF){
if(n==0) break;
for(i=0;i<n;i++){
cin>>node[i].x>>node[i].y;
}
sort(node,node+n,cmp);
j=0,s=1;
for(i=1;i<n;i++){
if(node[i].x>=node[j].y){
s++;
j=i;
}
}
printf("%d\n",s);

}
return 0;
}