题目:
示例:
#include <iostream>
#include <algorithm>
using namespace std;
const int N=110;
struct Act
{
int start;
int ending;
} E[N];
bool cmp(Act a,Act b)
{
if(a.start!=b.start)
return a.start>b.start;
else
return a.ending<b.ending;
}
int main()
{
int n;
while(cin>>n)
{
if(n==0) break;
for(int i=0; i<n; i++)
{
cin>>E[i].start;
cin>>E[i].ending;
}
sort(E,E+n,cmp);
int ans=1,lastx=E[0].start;
for(int i=1; i<n; i++)
{
if(E[i].ending<=lastx)
{
lastx=E[i].start;
ans++;
}
}
cout<<ans;
}
return 0;
}