#include<iostream> #include<algorithm> #include<stdlib.h> #include<string.h> using namespace std; #define MAXLEN 10 void gree(int n,int x[]){ sort(x,x+n); int *s1,*s2,*t1,*t2; s1=(int *)malloc(n*sizeof(int)); s2=(int *)malloc(n*sizeof(int)); t1=(int *)malloc(n*sizeof(int)); t2=(int *)malloc(n*sizeof(int)); int i,j; for(i=0;i<n;i++){ t1[i]=0; t2[i]=0; } for(i=0,j=0;i<n;j++,i++){ s1[j]=x[i]; i++; s2[j]=x[i]; } int m=j; for(i=0;i<m-1;i++){ for(j=0;j<i+1;j++){ t1[i]+=s1[j]; t2[i]+=s2[j]; } } float sum=0; for(i=0;i<m;i++){ sum=sum+t1[i]+t2[i]; } cout<<"平均等候时间:"<<sum/n<<endl; free(s1); free(s2); free(t1); free(t2); } int main(){ int x[10]={1,2,3,4,5,6}; int n=6; gree(n,x); return 0; }
