#include<iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct jiemu
{
int start;
int end;
bool operator < (const jiemu& W) const{
return end < W.end;
}
};
jiemu J[100];
int main()
{
int n;
while(cin>>n&&n!=0)
{
int i =0;
while(n--)
{
cin>>J[i].start>>J[i].end;
i++;
}
sort(J,J+i);//按end时间升序
int sum =0;
int j = 0;
int end = -1;
while(j<i)
{
if(end <= J[j].start)
{
sum++;
end = J[j].end;
}
j++;
}
cout<<sum<<endl;
}
}
/**************************************************************
Problem: 1434
User: hrdjmax2
Language: C++
Result: Accepted
Time:10 ms
Memory:1520 kb
****************************************************************/
九度题目1434:今年暑假不AC
最新推荐文章于 2020-09-30 17:49:31 发布