#include<iostream>
#include<algorithm>
using namespace std;
typedef struct pers{
int id;
int time;
}customer;
bool cmp(const customer& a,const customer& b)
{
return a.time<b.time;
}
float cal(customer *cus,int s,int n)
{
float sum=0;
int temp[s];
for(int i=0;i<s;i++){
temp[i]=0;
}
for(int i=0;i<n;i++){
temp[i%s]+=cus[i].time;
sum+=temp[i%s];
}
return sum/n;
}
int main()
{
customer cus[20] ;
int n;
int s;
cout<<"请输入顾客的数量:"<<endl;
cin>>n;
cout<<"顾客的编号根据输入的次序从零开始编号"<<endl;
cout<<"请依次输入每位顾客的等待时间:"<<endl;
for(int i=0;i<n;i++){
cus[i].id=i;
cin>>cus[i].time;
}
sort(cus,cus+n,cmp) ;
cout<<"请输入能同时提供服务的数量:"<<endl;
cin>>s;
cout<<"顾客服务的顺序为"<<endl;
int isprime=0;
for(int k=0;k<s;k++){
cout<<k+1<<"号服务区";
for(int i=isprime;i<n;i=i+s){
cout<<cus[i].id<<",";
}
isprime++;
cout<<endl;
}
cout<<"最小平均等待时间为:"<<cal(cus,s,n);
return 0;
}