#include<stdio.h>
int n;
struct node
{
int num;
int d;
int e;
};
struct node q[1000];
void sort(struct node q[])
{
for(int i = 0; i < n; i ++)
{
for(int j = i; j < n; j ++)
{
if(q[i].e > q[j].e)
{
int temp = q[i].e;
q[i].e = q[j].e;
q[j].e = temp;
temp = q[i].d;
q[i].d = q[j].d;
q[j].d = temp;
}
}
}
}
int main()
{
scanf("%d",&n);
for(int i = 0; i < n; i ++)
{
scanf("%d%d",&q[i].d,&q[i].e);
q[i].num = i;
}
sort(q);
int sum = 1;
int ddl = q[0].e;
for(int j = 1; j < n; j ++)
{
if(q[j].d >= ddl)
{
sum = sum + 1;
ddl = q[j].e;
}
}
printf("%d\n",sum);
return 0;
}
活动安排问题 动态规划
最新推荐文章于 2024-06-20 00:32:05 发布