磁带最优存储问题-贪心算法

#include//磁带最优存储问题 
#define N 100
struct pro
{
	double length;
	double p;
};

void minLen(struct pro pros[],int n)
{
	
	double sum[N],t;
	double s=0,minL=0;
	int j;
	int i;
	for(i=0;ipros[j+1].length)
			{
				t=pros[j].length;
				pros[j].length=pros[j+1].length;
				pros[j+1].length=t;
			}
		}
	}
	t=pros[0].length;
	sum[0]=t;
	minL+=sum[0];
	for(i=1;i