yes, it's correct. simply sort according to their costs (in decreasing order)
On Mon, Jun 6, 2011 at 11:52 PM, sunny agrawal <[email protected]>wrote: > Sort in decreasing order of Ci ? > > > On Tue, Jun 7, 2011 at 8:22 AM, aanchal goyal <[email protected]>wrote: > >> Given n jobs, each ith job has a cost Ci associated with it. The waiting >> time for a job i is defined as Ci*Delay, where Delay is the number of days >> it takes from the first day to complete a job. Assume each job can be >> completed in 1 day. So, a job started at day 1 will have delay=1, the one >> started at day 2 will have delay=2, etc. Order the jobs in such a way that >> waiting time is minimum. >> >> >> -- >> Regards,* >> Aanchal Goyal*. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Sunny Aggrawal > B-Tech IV year,CSI > Indian Institute Of Technology,Roorkee > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- -Aakash Johari (IIIT Allahabad) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
