浙江科技学院第十三届程序设计竞赛 1008 A Heavy Rainy Day 贪心

#include<map>
#include<queue>
#include<cmath>
#include<cstdio>
#include<stack>
#include<iostream>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define mod 1000000007
#define ls l,mid,rt<<1
#define rs mid+1,rt,rt<<1|1
#define LL __int64
using namespace std;
int nu[1010];

int main(){
int n,m,i,j,k,cla;
while(~scanf("%d",&n)){
for(i = 0;i < n;++ i){
scanf("%d",&nu[i]);
}
int ans = 0;
sort(nu,nu + n);
while(n >= 4){
if(2*nu[0]+nu[n-2]+nu[n-1] > 2*nu[1]+nu[0]+nu[n-1])
ans += 2*nu[1]+nu[0]+nu[n-1];
else
ans += 2*nu[0]+nu[n-2]+nu[n-1];
n -= 2;
}
if(n == 3)
ans += nu[0]+nu[1]+nu[2];
else if(n == 2)
ans += nu[1];
else
ans += nu[0];
printf("%d\n",ans);
}
return 0;
}