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.
Input
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. Each case is preceded by a blank line. There won’t be more than 1000 people and nobody takes more than 100 seconds to cross.
Output
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
Sample Input
1
4
1 2 5 10
Sample Output
17
解题思路
本题是用贪心做的,首先分开讨论
当n=1时,时间是第一个用的时间。
当n=2时,时间是两人用的最长的。
当n=3时,时间是3人的总和。
当n=4时,分2种情况。
第一种是用最快的运最慢的。
第二种是最快的和次快的先过去,然后最快的回来,再让最慢的和次慢的过去,让次快的回来,最后次快的和最快的再过河。
列如1 2 5 10
第一种是1和10过去,1回来,然后1和5过去,1回来,最后1和2过去。总时间是11+6+2=19.
第二种是1和2过去,1回来,然后5和10过去,2回来,最后1和2过去。总时间是3+10+2+2=17.
当n>4时,比较运送最慢的和次慢的用第一种和第二种那个时间少,选取少的。
重复上述步骤。
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e5+10;
int a[maxn];
int n;
int fun(){//第一种的函数
return a[0]*2+a[n-1]+a[n-2];
}
int qwe(){//第二种的函数
return a[0]+a[1]*2+a[n-1];
}
int main(){
int t;
cin>>t;
while(t--){
cin>>n;
if(n==0){
cout<<"0"<<"\n";
continue;//注意要特判下n==0的情况
}
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
if(n==1){
cout<<a[0]<<"\n";
continue;
}
if(n==2){
cout<<a[1]<<"\n";
continue;
}
if(n==3){
cout<<a[0]+a[1]+a[2]<<"\n";
continue;
}
int ans=0;
do{
if(fun()>qwe()){
ans+=qwe();
}
else ans+=fun();
n-=2;
}while(n>3);
if(n==1){
cout<<ans+a[0]<<"\n";
}
if(n==2){
cout<<ans+a[1]<<"\n";
}
if(n==3){
cout<<ans+a[0]+a[1]+a[2]<<"\n";
}
}
return 0;
}