贪心法求解活动安排问题hdu_2037

#include
using namespace std;
int n;
struct node {
     
    int begin, end;
};
bool cmp(node &a,node &b){
     
    return a.end<b.end;
}
int main(){
     
    cin>>n;
    node record[n];
    int count=0,endnum=-1;
    for(int i=0;i<n;i++)
        cin>>record[i].begin>>record[i].end;
    int a; cin>>a;//a=0
    sort(record,record+n,cmp);
    for(int i=0;i<n;++i)
        if(record[i].begin>=endnum){
     
            count++;
            endnum=record[i].end;
        }
    cout<<count<<endl;
}

注意

1. bool cmp(node &a,node &b){
   return a.end }
   判定函数的书写
2. if(record[i].begin>=endnum){
   是>=的关系