duochuzuiyoufuwucixuwenti.cpp

多处最优服务次序问题

#include <iostream.h>

int service(int *people,int n,int s)
{
	int *m;                                   //每个服务场地当前被占用的时间
	int temp;
	int i,j,a,sum=0;
	m=new int[s];
	for(i=0;i<n;i++){                        //将顾客按服务时间大小排序
		for(j=n-1;j>i;j--){
			if(people[j]<people[j-1]){
				temp=people[j];
				people[j]=people[j-1];
				people[j-1]=temp;
			}
		}
	}
	for(i=0;i<s;i++)m[i]=0;
	for(j=0;j<n;j++){                        //选择场地
		a=0;
		for(i=0;i<s;i++)if(m[a]>m[i])a=i;
		//sum+=m[a];
		m[a]+=people[j];
		sum+=m[a];
	}
	return sum/n;
}

void main()
{
	int *people;
	int n;
	int s;
	cout<<"请输入顾客人数：";
	cin>>n;
	people=new int[n];
	cout<<"请输入提供服务的场地数：";
	cin>>s;
	cout<<"请输入各个顾客服务的时间("<<n<<"个数):";
	for(int i=0;i<n;i++)cin>>people[i];
	cout<<"最小平均等待时间:"<<service(people,n,s)<<endl<<endl;
}