Description: acm algorithm design Description: n has a customer waiting for a service at the same time. I need to service customers time ti, 1 < = i < = n. N how to arrange the order of a customer' s service to make the average waiting time to a minimum? Average waiting time is n-time customers wait for service by dividing the sum of n. N for a given month of the service needs of customers, the best services to the order of the calculation program. Input: the first line is a positive integer n, that there are n customer. 1 the next line, there is a positive integer n, that n of the service needs of customers. Output: the minimum average waiting time for cases of type: 10 56 12 1 99 1000 234 33 55 99 812 cases Output: 532.00
File list (Check if you may need any files):
Optimal Services
................\Debug
................\.....\Optimal Services.exe
................\.....\Optimal Services.ilk
................\.....\Optimal Services.obj
................\.....\Optimal Services.pch
................\.....\Optimal Services.pdb
................\.....\StdAfx.obj
................\.....\vc60.idb
................\.....\vc60.pdb
................\Optimal Services.cpp
................\Optimal Services.dsp
................\Optimal Services.dsw
................\Optimal Services.ncb
................\Optimal Services.opt
................\Optimal Services.plg
................\ReadMe.txt
................\StdAfx.cpp
................\StdAfx.h
Download