Crossing River

最新推荐文章于 2020-10-26 21:01:11 发布

linylin

最新推荐文章于 2020-10-26 21:01:11 发布

阅读量212

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/linylin/article/details/76820944

版权

贪心专栏收录该内容

6 篇文章 0 订阅

订阅专栏

描述

A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a different rowing speed; the speed of a couple is determined by the speed of the slower one. Your job is to determine a strategy that minimizes the time for these people to get across.

输入

The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. There won't be more than 1000 people and nobody takes more than 100 seconds to cross.

输出

For each test case, print a line containing the total number of seconds required for all the N people to cross the river.

样例输入

1
4
1 2 5 10

样例输出

题解

#include <cstdio>
#include <iostream>
#include <algorithm>
int i,j,k,l,m,n,p,o,ans;
int a[10001];
int main()
{
	scanf("%d",&p);
	for (o=1;o<=p;o++)
	{
		scanf("%d",&n);
		for (i=1;i<=n;i++)
		scanf("%d",&a[i]);
		std::sort(a+1,a+n+1);
		ans=0;
		while (n>3)
		{
			k=a[2]*2+a[1]+a[n];//先将第二快的载回来，最快的划船回去，第二慢的和最慢的回来，第二慢的划船过去 
			l=a[n]+a[1]*2+a[n-1];//最快的和最慢的回来，最快的划船回去，最快的和第二慢的回来，第二慢的划船回去 
			if (k>l) ans=ans+l;
			else ans=ans+k;
			n=n-2;
		}
		if (n==3) ans=ans+a[1]+a[2]+a[3];//先将最慢的回来，最快的划船回去，将第二慢的载回来 
		else
		if (n==2) ans=ans+a[2];//剩下的两个人乘船回来 
		else ans=ans+a[1];//自己乘船 
		printf("%d\n",ans);
	}
}