Pro.ID22667 TitleBridge over a rough river Title链接http://10.20.2.8/oj/exercise/problem?problem_id=22667 AC6 Submit13 Ratio46.15% 时间&空间限制描述A group of N travelers (1 ≤ N ≤ 50) has approached an old and shabby bridge and wishes to cross the river as soon as possible. However, there can be no more than two persons on the bridge at a time. Besides it's necessary to light the way with a torch for safe crossing but the group has only one torch. Each traveler needs ti seconds to cross the river on the bridge; i=1, …, N ( ti are integers from 1 to 100 ). If two travelers are crossing together their crossing time is the time of the slowest traveler. The task is to determine minimal crossing time for the whole group. 输入Input consists of two lines: the first line contains the value of N and the second one contains the values of ti ( separated by one or several spaces ) . 输出Description A group of N travelers (1 ≤ N ≤ 50) has approached an old and shabby bridge and wishes to cross the river as soon as possible. However, there can be no more than two persons on the bridge at a time. Besides it's necessary to light the way with a torch for safe crossing but the group has only one torch. Each traveler needs ti seconds to cross the river on the bridge; i=1, …, N ( ti are integers from 1 to 100 ). If two travelers are crossing together their crossing time is the time of the slowest traveler. The task is to determine minimal crossing time for the whole group. Input Input consists of two lines: the first line contains the value of N and the second one contains the values of ti ( separated by one or several spaces ) . Output Output one line with the result. Sample Input 4 Sample Output 29 Source 样例输入4 样例输出29 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-5 18:00 , Processed in 0.035736 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
