51nod贪心算法入门—–活动安排问题2

#include<iostream>
#include<stdlib.h>
#include<queue>
using namespace std;
struct 
{
   int start;
   int end;
}s[10001];
int cmp(const void *a,const void *b)
{
    return (*(node*)a).start>(*(node*)b).start?1:-1;
}
int main(){
    //freopen("C://Users//Administrator//Desktop//duipai2//data.txt","r",stdin);
//freopen("C://Users//Administrator//Desktop//duipai2//out1.txt","w",stdout);
    int n,i,rooms=0;
     priority_queue<int,vector<int>, greater<int> > myqueue;//优先队列类型
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d%d",&s[i].start,&s[i].end);
    qsort(s,n,sizeof(node),cmp);
    myqueue.push(s[0].end);
    rooms=1;
    for(i=1;i<n;i++){
        if(s[i].start<myqueue.top()){
            rooms++;
            myqueue.push(s[i].end);
        }
        else{
            myqueue.pop();
            myqueue.push(s[i].end);
        }
    }
    printf("%dn",rooms);
}