POJ1700—-Crossing River

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int a[];
 int min(int x, int y)
 {
     return x < y ? x : y;
 }
 int main()
 {
     int t, n;
     cin >> t;
     while (t--)
     {
         cin >> n;
         for (int i = ; i < n; ++i)
             cin >> a[i];
         sort(a, a + n);
         int ans = , ant = n - ;
         while (ant >= )
         {
             if ( ant == ) ans += a[];
             else if (ant == ) ans += a[];
             else if (ant == ) ans += a[] + a[] + a[];
             else ans += min( * a[] + a[ant] + a[ant - ],  * a[] + a[] + a[ant]);
             if (ant > ) ant -= ;//大于3个时，2组两组进行
             else break;
         }
         cout << ans << endl;
     }
     return ;
 }