编程揭秘：如何用代码算出 N 匹小马过河的最短时间？

```python # 读取输入 n = int(input()) times = list(map(int, input().split())) # 对小马过河时间进行排序 times.sort() total_time = 0 while len(times) > 3: # 方案一：最快和次快送最慢和次慢 plan1 = times[1] + times[0] + times[-1] + times[1] # 方案二：最快分别送最慢和次慢 plan2 = times[-1] + times[0] + times[-2] + times[0] # 选择用时少的方案 total_time += min(plan1, plan2) # 去掉已经过河的最慢和次慢的小马 times = times[:-2] if len(times) == 3: total_time += times[0] + times[1] + times[2] elif len(times) == 2: total_time += times[1] else: total_time += times[0] print(total_time) ``` ######[AI问答 | 243点数解答 | 2026-02-07 20:30:57]