【DP】过桥

思路

快排后DP

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int Time[1025],People[1025];
//Time表示第i个人过桥需要的时间
//People表示前i个人过桥需要的最少时间
int n;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%d",&Time[i]);
	sort(Time+1,Time+n+1);
	People[1]=Time[1];
	People[2]=Time[2];
	for(int i=3;i<=n;++i)
		People[i]=min(People[i-1]+Time[1]+Time[i],
		People[i-2]+Time[1]+Time[2]*2+Time[i]);
	printf("%d",People[n]);
	return 0;
}