Fashionable dressmaker’s problem

§A fashionable dressmaker has N orders from customers which she must satisfy. §The dressmaker can work on only one job in each day, and jobs usually take several days. §For the ith job, the integer Ti (1 < Ti < 1,000) denotes the number of days it takes the dressmaker to finish the job.§But popularity has its price. §For each day of delay before starting to work on the ith job, the dressmaker has agreed to pay a fine of Si (1 £ Si £ 10,000) cents per day. §Help the dressmaker by writing a program to find the sequence of jobs with minimum total fine.§Test Using 3 Different Data Sets (te..........

원문링크 : Fashionable dressmaker’s problem