poj 1700 Crossing River

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

题目大概意思是有一群人需要过河，每个人过河都需要一定的时间，有一艘船可以容纳两个人，但是两个人上船过河，所花时间为两人中的较大者，问所有人过河的最短时间。

　　容易想到一种方案：花费时间最少的人和花费时间最多的人一起，然后时间最少的人回来。因为时间少的人会被时间多的人“拖累”，既然时间多的人不得不花这么长的时间过河，并且船还得回来，所以不妨让时间最少的人和他一起，由时间最少的人开船回来，这样额外时间（指一个人开船回来花的时间）会尽量少。
　　起先我也是这么个想法的，但是，查了一下发觉还真不是真么简单的，还有一个方法：让最快的和次快的先过去，然后次快的回来，然后最慢的和次慢的一起过去，然后最快的回来，完成了一个循环，照这样循环下去似乎也可以得到更短的时间呢。
　　于是乎我们可以对每两位旅客，判断那种方式更好，然后计算出最短时间

代码：

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<list>
#include<iterator>
#include<stack>
#include <queue>
#include <cstdio>
#include<algorithm>
using namespace std;
typedef  long long ll;
typedef unsigned long long ull;
#define e 2.718281828459
#define INF 0x7fffffff
#pragma warning(disable:4996)
#define sf scanf
#define pf printf
const double pi = acos(-1.0);
const int MAX = 10005;
//#define  eps 1e-9;



int main(void) {
    int t;
    int n;
    int peo[1000];
    sf("%d", &t);
    while (t--) {
        ull sum = 0;
        int ti1, ti2;
        sf("%d", &n);
        for (int i = 0; i < n; i++)
            sf("%d", &peo[i]);
        sort(peo, peo + n);
        int i;
        for (i = n - 1; i > 2; i -= 2) {//for (int i = n - 1; i > 0; i -= 2) {
                ti1 = peo[i] + peo[i - 1] + 2 * peo[0];//方式1：最快的将慢的一个个宋
                ti2 = peo[i] + peo[0] + 2 * peo[1];//方式二：最快，次快去，最快（或次快）回，最慢和次慢去，次快（或最快）回
                if (ti1 < ti2)//对每两个人，挑时间少的方式
                    sum += ti1;
                else
                    sum += ti2;
        }

        if (i == 2) {//奇数情况
            sum += peo[2] + peo[0] + peo[1];//最后三人
        }
        else if (i == 1) {//偶数情况
            sum += peo[1];//最后两人
        }
        else
            sum += peo[0];

        pf("%lld\n", sum);


    }


    return 0;
}