POJ 1700 Crossing 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

Sample Output

17

样例解释：1和2过去，1回来送船。5和10过去，2回来送船，然后1和2一起过去。所用时间为2+1+10+2+2=17。

贪心思路：首先对他们从小到大排序。基于贪心思想
1.耗时最短的人在船上来回送人
2.耗时最短的人来回送船，然后让两个耗时最长的人一起走。（实现方法就是耗时最短的送船回来，俩新人人过去，耗时次短的来接最短的过岸）
这样就以4为一个循环。每次耗时最短+耗时次短+2新人，然后取min，当人数<=3时，情况唯一，直接特判输出。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn=10005;
int a[maxn];
int main()
{
    int n,m;
    scanf("%d",&n);
    for(int k=0;k<n;k++)
    {
        int sum=0;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        scanf("%d",&a[i]);
        sort(a+1,a+m+1);
        for(int i=m;i>=1;i-=2)
        {
            if(i==3)
            {
                sum+=a[1]+a[2]+a[3];
                break;
            }
            if(i==2)
            {
                sum+=a[2];
                break;
            }
            if(i==1)
            {
                sum+=a[1];
                break;
            }
            else sum+=min(a[1]+2*a[2]+a[i],2*a[1]+a[i]+a[i-1]);
        }
        printf("%d\n",sum);
    }
}