hdu 2037贪心

#include <iostream>
#include <algorithm>
using namespace std;

struct ss
{
       int st;
       int ed;
}node[110];

//按电视节目结束时间排序 
bool cmp(ss s1,ss s2)
{
     return s1.ed < s2.ed || (s1.ed == s2.ed && s1.st < s2.st);
}

int main()
{
    int ans;
    int n;
    int k;
    while(cin>>n,n!=0)
    {
          for(int i = 0; i < n; i++)
          {
                  cin>>node[i].st>>node[i].ed;
          }
          sort(node,node+n,cmp);
          ans = 1,k = 0;
          for(int i = 1; i < n; i++)   //贪心选择，永远选取最优解 
          {
                  if(node[i].st >= node[k].ed)
                  {
                        ans ++;
                        k = i;
                  }
          }
          cout<<ans<<endl;
    }
    return 0;
}