[UVA][Greedy] 10026 - Shoemaker's Problem
Shoemaker's Problem
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 finis...