Tino面临一个使用‘搬运杆’平衡携带橙子的问题，目标是两边重量相等。每个橙子都有自己的重量，他想知道能携带的最大总重量是多少。这是一个运用贪婪算法来求解的问题。
-
题目描述：
-
Tino wrote a long long story. BUT! in Chinese...
So I have to tell you the problem directly and discard his long long story. That is tino want to carry some oranges with "Carrying pole", and he must make two side of the Carrying pole are the same weight. Each orange have its' weight. So greedy tino want to know the maximum weight he can carry.
-
输入：
最低0.47元/天 解锁文章
扫一扫
894
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
