COJ 1390今年暑假不AC

简单的贪心……

#include<iostream>
#include<algorithm>
#define M 110
using namespace std;
struct abc
{
    int s;
    int e;
}s[M];
bool cmp(abc a,abc b)
{
    return a.e<b.e; 
}
void main()
{ 
  int n;
  cin>>n;
  int c=1,i,t;
  for(i=0;i<n;i++)
     cin>>s[i].s>>s[i].e;
  sort(s,s+n,cmp);
  t=s[0].e;
  for(i=1;i<n;i++)
     if(s[i].s>=t)
	 {
         c++;
         t=s[i].e;
     }
  cout<<c<<endl;
}