- //最优服务次序
- #include <iostream>
- using namespace std;
- void quick_sort(int *a,int x,int y)
- {
- int xx=x,yy=y;
- int k=a[x];
- if(x>=y)
- return;
- while(xx!=yy)
- {
- while(xx<yy && a[yy]>=k)
- yy--;
- a[xx]=a[yy];
- while(xx<yy && a[xx]<=k)
- xx++;
- a[yy]=a[xx];
- }
- a[xx]=k;
- quick_sort(a,x,xx-1);
- quick_sort(a,xx+1,y);
- }
- int main(int argc, char *argv[])
- {
- /*
- int n;
- cin >> n;
- int each__t[n];
- for(int i=0; i<n; i++)
- {
- cin >> each__t[i];
- }*/
- int n=10;
- int each__t[n];
- each__t[0] = 56;
- each__t[1] = 12;
- each__t[2] = 1;
- each__t[3] = 99;
- each__t[4] = 1000;
- each__t[5] = 234;
- each__t[6] = 33;
- each__t[7] = 55;
- each__t[8] = 99;
- each__t[9] = 812;
- quick_sort(each__t,0,n-1);
- for(int i=0; i<n; i++)
- {
- cout << each__t[i] << " ";
- }
- cout << endl;
- int wait_t[n];
- float sum_t=0;
- wait_t[0] = each__t[0];
- for(int i=1; i<n; i++)
- {
- wait_t[i] = wait_t[i-1] + each__t[i];
- }
- for(int i=0; i<n; i++)
- {
- cout << wait_t[i] << " ";
- }
- cout << endl;
- for(int i=0; i<n; i++)
- {
- sum_t += wait_t[i];
- }
- printf("%5.2f\\n",sum_t/n);
- return 0;
- }
- //该片段来自于http://www.codesnippet.cn/detail/2306201512908.html
来源: http://www.codesnippet.cn/detail/2306201512908.html