POJ_1700_Crossing River

#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#include<numeric>
#pragma warning(disable:4996)
#include<cstdio>
#include<cstdlib>
using std::cin;
using std::cout;
using std::endl;
using std::stringstream;
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::set;
using std::multiset;
using std::map;
using std::multimap;
using std::stack;
using std::queue;
using std::priority_queue;
int main()
{
	//freopen("input.txt", "r", stdin);  
	//freopen("output.txt", "w", stdout);  
	int T;
	while (cin >> T)
	{
		while (T--)
		{
			int n; cin >> n;
			vector<int>time(n);
			for (int i = 0; i < n; i++)
			{
				cin >> time[i];
			}
			std::sort(time.begin(), time.end());
			int sum = 0;
			while (n > 3)
			{
				sum += std::min(time[1]+time[0]+time[n-1]+time[1],time[n-1]+time[0]+time[n-2]+time[0]);
				n -= 2;
			}
			if (n == 3)
			{
				sum += time[0] + time[1] + time[2];
			}
			else if (n == 2)
			{
				sum += time[1];
			}
			else
			{
				sum += time[0];
			}
			cout << sum << endl;
		}
	}
	return 0;
}