POJ-1456-Crossing River（过河）

Crossing River

过河

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 18400		Accepted: 6906

Description

描述

A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a different rowing speed; the speed of a couple is determined by the speed of the slower one. Your job is to determine a strategy that minimizes the time for these people to get across.

一群人，人数为N，他们希望只用一条船过河，这条船最多只能载两人。所以，必须安排一些往返的顺序可以来回划船，以便于所有人可以通过。每个人有不同的划船速度，每组的速度取决于较慢的哪一个。你的任务是确定一个策略可以让这些人用最少的时间通过。

Input

The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won't be more than 1000 people and nobody takes more than 100 seconds to cross.

第一行包含一个整数 T (1 <= T <= 20) 作为测试组的数量，然后是 T 个案例。每个案例的第一行包行一个N，第二行包含N个整数代表每个人过河的时间。每个案例前是一个空行。不会超过1000人，并且不会有人花费超过100s通过。

Output

For each test case, print a line containing the total number of seconds required for all the N people to cross the river.

Sample Input

1
4
1 2 5 10

Sample Output

17

Source

POJ Monthly--2004.07.18