Shoemaker has N jobs (orders from customers) which he must make. Shoemaker can
work on only one job in each day. For each ith job, it is known the integer Ti (1<=Ti<=1000), the time in days it takes the shoemaker to finish the job.
For each day of delay before starting to work for the ith job, shoemaker must pay a fine of
Si (1<=Si<=10000) cents. Your task is to help the shoemaker, writing a programm to find the sequence of jobs with minimal total fine.
1 4 3 4 1 1000 2 2 5 5
2 1 3 4