hdu 2037 今年暑假不AC (看电视贪心)

1 for(int i = 1 ; i < n ; i ++){
2         if(tv[i].s >= endtime){
3             cnt++;
4             endtime = tv[i].e;    
5         }
6     } 

#include<cstdio>
#include<iostream>
#include<queue>
#include<string>
#include<math.h>
#include<stack>
#include<cstdlib>
#include<set>
#include<map>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cctype>
#include<sstream>

const double PI = acos(-1.0);
typedef long long ll;
using namespace std; 

int n;

struct Node{
    int s,e;
};
Node tv[110];
bool cmp(const Node& lhs,const Node& rhs){
    return lhs.e < rhs.e;
}
void solve(){
    int cnt = 1;
    int endtime = tv[0].e;
    for(int i = 1 ; i < n ; i ++){
        if(tv[i].s >= endtime){
            cnt++;
            endtime = tv[i].e;    
        }
    } 
    printf("%d\n",cnt);
} 
int main(){
    while(scanf("%d",&n) != EOF && n){
        for(int i = 0 ; i < n ; i ++)    scanf("%d %d",&tv[i].s,&tv[i].e);
        sort(tv,tv+n,cmp);
        solve();        
    }    
    return 0;
}