Description: For each set of input data, the first line of three integers N, S and Q. Where N (2 < = N < = 100) means that the number of ring station. S (1 < = S < = 100) indicates the maximum capacity of trucks, which can be loaded truck while many boxes of goods. And Q (1 < = Q < = 100) means that can be placed on platform B of the total number of goods, the system assumes that all of the maximum cargo capacity of station B are the same platform. From the second row back a total of N lines, each one the first number represents the station B the total number of goods on the platform, each number represents carton after delivery of goods to which station. For each case, you need a separate output line to complete the task required.
To Search:
File list (Check if you may need any files):
001 孤独的运货员.cpp
Download