crosing river（贪心）

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.

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.

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
Output
17

题目意思：有n个人想过河，每个人有自己的过河时间，只有一只小船，最多只能装2个人，且过河时间为两个人中速度慢的，如果还有人没有过河，需要一个人将船送回。问 n 人过河最少要多少时间。

解题思路：

如果有N个人（N>=1）
如果N=1或N=2；所有人直接过河。
如果N=3；由最快的人往返一次把其他两人送过河。
如果N>=4;设 A，B 为走的最快的和次快的人，过桥时间为 a，b；
设 C，D 是走的最慢和次慢的人，过桥时间为 c,d：

• 模式一：A 将 C 送过桥，然后返回，再把 D 送过桥，再返回。
• 模式二：A, B 先过桥，然后 A 返回，C 和 D 过桥，然后 B 返回。

看两种模式哪种用时较少。问题变回n-2个人，递归解决。

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int T;
	int a[1005];
	cin >> T;
	while (T--)
	{
		int n, i;
		cin >> n;
		for (i = 0; i < n; i++)
			cin >> a[i];
		sort(a, a + n);
		int k = n - 1;
		int sum = 0;
		while (k >= 0)
		{
			if (k >= 3)
			{
				int t1 = a[0] + 2 * a[1] + a[k];
				int t2 = 2 * a[0] + a[k] + a[k - 1];
				sum += min(t1, t2);
			}
			else if (k == 2)
				sum += a[1] + a[2];
			else
				sum += a[k];
			k -= 2;
		}
		cout << sum << endl;
	}
	return 0;
}