Problems Description
<p class="MsoNormal"> <span style="font-family:宋体;">现有一天平和</span><span>N</span><span style="font-family:宋体;">粒小石子,每粒石子质量记为</span><span>Mi(1<=i<=N)</span><span style="font-family:宋体;">,将其points成两堆。由于天平能够承载的倾斜程度有限,处于安全考虑,尽量使石子放在天平之后,天平倾斜角度最小。</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">求取天平偏角最小时,天平左盘可能放置的石子总质量。</span> </p>
Input格式
<p class="MsoNormal"> <span style="font-family:宋体;">每组包含两行,</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">Page 一行输入</span><span>N(0<N<500)</span><span style="font-family:宋体;">,</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">Page 二行输入</span><span>N</span><span style="font-family:宋体;">颗石子的质量</span><span>Mi(0<i<=N,0<Mi<20,Mi</span><span style="font-family:宋体;">为整数</span><span>)</span><span style="font-family:宋体;">。</span> </p>
Output格式
<p class="MsoNormal"> <span style="font-family:宋体;">每行输出天平左盘可能放置的石子总质量。(升序输出)</span> </p>
Sample
Sample Input 1
3
1 2 4
5
1 1 1 1 1
Sample Output 1
3 4
2 3
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪