贪心算法作业的解题报告和源代码。问题描述：在深夜里，n 个人想要尽快地通过一条河。河上有一座狭小的桥，每次最多只能两个人一起过河。由于桥上的道路一片漆黑，他们必须用仅有一个手电筒，来照亮道路。已知 n 个人过河分别需要 t1,t2,…,tn 的时间，两个人一起过河所需要的时间是取决于速度较慢的人所需要的时间。请计算出 n 个人过河所需要的最小时间。-Greedy algorithm for solving the report and source code. Problem Descr iption: In the night, n individuals want as quickly as possible through a river. There is a small river on the bridge, each with a maximum of only two people crossing a river. As a result of the bridge the road was dark, they must use only a flashlight to illuminate the road. N individuals were known to cross the river need to t1, t2, ..., tn time, two people with the time required to cross the river is slow depending on the person required. Please individuals across the river n to calculate the minimum time required.