
ZOJ Problem Set  2501
A train has a locomotive that pulls the train with its many passenger coaches. If the locomotive breaks down, there is no way to pull the train. Therefore, the office of railroads decided to distribute three mini locomotives to each station. A mini locomotive can pull only a few passenger coaches. If a locomotive breaks down, three mini locomotives cannot pull all passenger coaches. So, the office of railroads made a decision as follows:
If three mini locomotives pull passenger coaches 12, 34, and 67, they can transport 240 passengers. In this example, three mini locomotives cannot transport more than 240 passengers. Given the number of passenger coaches, the number of passengers in each passenger coach, and the maximum number of passenger coaches which can be pulled by a mini locomotive, write a program to find the maximum number of passengers which can be transported by the three mini locomotives. Input Specification The first line of the input file contains a single integer t (1 <= t <= 11), the number of test cases, followed by the input data for each test case. The input for each test case will be as follows: The first line of the input file contains the number of passenger coaches, which will not exceed 50,000. The second line contains a list of space separated integers giving the number of passengers in each coach, such that the ith number of in this line is the number of passengers in coach i. No coach holds more than 100 passengers. The third line contains the maximum number of passenger coaches which can be pulled by a single mini locomotive. This number will not exceed 1/3 of the number of passenger coaches. Output Specification There should be one line per test case, containing the maximum number of passengers which can be transported by the three mini locomotives. Sample Input 1 7 35 40 50 10 30 45 60 2 Sample Output 240 Source: Asia 2004, Tehran (Iran), Sharif Preliminary 