贪心策略：acm 会场安排

#include<stdio.h>
 
struct Job{
	int begin,end;
	int flag;
};
 
int manage(int n,Job *b){
	int count=n,room=0,roomNum=0;
	while(count>0){
		for(int i=1;i<=n;i++){
			if((b[i].begin>room)&&(b[i].flag==0)){  //贪心策略 
				room=b[i].end;
				b[i].flag=1;
				count--;
			}
		}
		room=0;
		roomNum++;
	}
	return roomNum;
}
 
int main(){
	int n,roomNum;
	scanf("%d",&n);
	Job b[n+1];
	b[0].begin=0;b[0].end=0;b[0].flag=0;
	for(int i=1;i<=n;i++){
		scanf("%d %d",&b[i].begin,&b[i].end);//接收数据 
		b[i].flag=0;
	}
    for(int i=1;i<=n;i++){                  //以结束时间的先后顺序排序 
		for(int j=i+1;j<=n;j++){
			if(b[i].end>b[j].end){
				Job temp=b[i];
				b[i]=b[j];
				b[j]=temp;
			}
		}
	}
	roomNum=manage(n,b);
	printf("%d\n",roomNum);
	return 0;
}