69,371
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
#include <stdlib.h>
void sort_change(int begin_time[],int end_time[],int n)
{
int i,j;
int temp1,temp2;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(end_time[i]>end_time[j])
{
temp1=end_time[j];
end_time[j]=end_time[i];
end_time[i]=temp1;
temp2=begin_time[j];
begin_time[j]=begin_time[i];
begin_time[i]=temp2;
}
}
}
}
int Fuc(int begin_time[],int end_time[],int n)
{
int idx=1;
int i=0,j;
for(j=1;j<n;j++){
if(end_time[i]<begin_time[j]){
idx++;
i=j;
}
}
return idx;
}
int main(void)
{
int n,i;
int Mycount;
int begin_time[10001]={0},end_time[10001]={0};
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++){
scanf("%d%d",&begin_time[i],&end_time[i]);
}
sort_change(begin_time,end_time,n);
Mycount=Fuc(begin_time,end_time,n);
printf("%d\n",Mycount);
}
return 0;
}