贪心算法-crossing river

/**/
#include <iostream>
#include<algorithm>
using namespace std;
int calc1(int *a,int n)
{
	return a[1] + a[0] + a[n - 1] + a[1];//第一种算法
}
int calc2(int* a, int n)
{
	return a[n - 1] + a[0]+a[n-2]+a[0];//第二种算法
}
int main()
{
	int m, n,sumtime;
	cin >> m;
	for (int i = 0; i < m; i++)
	{
		sumtime = 0;
		cin >> n;
		int* a = new int[n];
		for (int j = 0; j < n; j++)
		{
			cin >> a[j];
		}
		sort(a, a + n-1);
		if (n == 1)sumtime = sumtime + a[0];//一种特殊情况，另外考虑，当n大于1时满足下面所有
			else
			{
				while (n > 2)
				{
					if (calc1(a, n) < calc2(a, n))
					{
						sumtime = sumtime + calc1(a, n);
						n = n - 2;
					}
						else
					{
						sumtime = sumtime + calc2(a, n);
						n = n - 2;
					}
				}
				if (n == 2)sumtime = sumtime + a[1];
				if (n == 1)sumtime = sumtime - a[0];//因为多算了一次最快的
			}
		cout << sumtime << endl;
	}
}

题目:

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

Inputcopy	Outputcopy
1 4 1 2 5 10	17

题目大意:有N个人和一艘船，这个船最多载两个人。这N个人需要到对岸去，每个人都有一个不同的划船速度，当两个人一起划船时 速度取决于慢的那个人。求将所有人运到对岸所需要最短的时间。

方案一,也是最容易想到的：最快的人不断划船运输其他所有人。对a[n]进行排序后，可以知道一轮时间为a[0]+a[n-1]。

方案二:两轮一记。最快的两个人先到对岸后，最快的人回来。然后最慢的两个人到对岸后，次快的人回来。

由此举一反三，可以知道，当这个船可以载三个人时，方案有三个，可以载n个人时，方案有N个，每N轮对每种可能的坐船组合进行比较，可以得出最佳的答案。

最后需要考虑余数的情况。