活动安排问题贪心算法

#include<stdio.h>

struct Active {
	int size;//活动序号
	int start;//开始时间
	int end;//结束时间
	int state;//状态
};

void select(Active a[], int n)
{
	for (int i = 0; i < n - 1; i++)//冒泡排序按照结束时间从早到晚
		for (int j = 0; j < n - i - 1; j++)
		{
			if (a[j + 1].end < a[j].end)
			{
				Active temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
			}
		}
	
	int k = 0;
	a[k].state = 1;
	for (int i = 1; i < n; i++)//活动选择
	{
		if (a[i].start > a[k].end)
		{
			a[i].state = 1;
			k = i;
		}
	}

	for (int i = 0; i < n; i++)
		if (a[i].state)
			printf("%d加入到活动安排表\n", a[i].size);
}


int main()
{
	int n;
	Active a[100];
	printf("请输入活动的数目：");
	scanf_s("%d",&n);
	for (int i = 0; i <n;i++)
	{
		scanf_s("%d %d %d",&a[i].size,&a[i].start, &a[i].end);
		a[i].state =0;
	}
	for (int i = 0; i < n; i++)
		printf("%d %d %d\n", a[i].start, a[i].end, a[i].state);

	select(a, n);

}



[https://www.cnblogs.com/cxmhy/p/4477670.html](https://www.cnblogs.com/cxmhy/p/4477670.html)