Applying the concept of Dynamical programming;

The objective of this assignment is to apply the concept of Dynamical programming; A company would like to transport pedestrians by different categories of transportation( vehicle , bus , plane …) .Each categories of vehicle has certain capacity of passengers ( maximal number of passenger) and a certain cost . The company would like to know how many vehicle of each categories needs to be rent in order to minimize the cost of operation . INPUT: In the first Line , we have a value determining the number of cases to be consult . For each case we have a sequences of lines : The first line have an integer n that determine the number of different categories of vehicle available for this case . consider n<10 Each of the n lines available(means each i+1 line …. n) contain two numbers specifying the following parameters : 1 – capacity ( number of passengers) of a vehicle of type i 2 – the cost of location of a vehicle of type i - The last line of each case contain he number of the total persons to be transported . INPUT EXAMPLE OUTPUT EXAMPLE : Case 1 : the cost of transport of 1249 person is de 15090 $. We need to rent 3 vehicle of categories 4, 3 vehicle(s) de categories 2 and 1 vehicle(s) de categories 1. No more place available Case 2 : the cost of transport of 1250 person is de 15130 $. We need to rent 3 vehicle of categories 4, 1 vehicle(s) de categories 3 , 3 vehicle(s) of categories 1. 2 free space available. Case 3 : the cost of transport of 43 persons is de 660 $. We need to rent 11 vehicle of categories 1. 1 free space available .