POJ 1700非原创

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
		//freopen("a.txt", "r", stdin);
		//freopen("b.txt", "w", stdout);
	int n,m;
	scanf("%d",&n);
	
	while(n--){
		int a[1001], sum = 0, res1, res2, i = 0;
		scanf("%d",&m);
		for(i=0; i<m; ++i){
			scanf("%d",&a[i]);			
		}
		sort(a, a+m);
		for(i=m-1; i>2; i-=2){
			res1 = a[1] * 2 + a[0] + a[i];
			res2 = a[0] * 2 + a[i-1] + a[i];
			if(res1 > res2){
				sum += res2;
			}else{
				sum += res1;
			}			
		}
		if(i == 2){
			sum += a[2] + a[1] + a[0];			
		}else{
			sum += a[i];
		}
		printf("%d\n",sum);	
	}
}