E. Teamwork Gym 101492E

http://blog.youkuaiyun.com/now_ing/article/details/78148715

以下自己的AC代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull; 
ll dp[100005];
ll a[100005];
int main()
{
    int n;
    memset(dp,0,sizeof(dp));
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    scanf("%d",&a[i]);
    sort(a,a+n);
    dp[0]=a[0];
    dp[1]=a[1];
    for(int i=2;i<n;i++)
    {
        dp[i]=min(dp[i-1]+a[0]+a[i],dp[i-2]+a[0]+a[1]*2+a[i]);
    }
    printf("%lld\n",dp[n-1]);
    return 0;

}