poj 1700 贪心过河

#include<cstdio>#include<algorithm>#define max(x,y) ((x)>(y)?(x):(y))using namespace std;int main(){int T,n,t1,t2,res;int d[1100];scanf("%d",&T);while(T--){int res=0;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&d[i]);sort(d,d+n); for(int i=n-1;i>=0;i-=2){if(i==2){res+=d[0]+d[1]+d[2];break;    }    if(i==1)    {    res+=d[1];    break; }if(i==0){res+=d[0];break;} t1=d[0]+2*d[1]+d[i];t2=2*d[0]+d[i-1]+d[i];if(t1>t2)res+=t2;elseres+=t1;}printf("%d\n",res); } }