Problems Description
<p> </p> <p class="MsoNormal"><span style="font-family: 宋体">有一items箱子容量为</span><span>V(</span><span style="font-family: 宋体">正整数，</span><span>o</span><span style="font-family: 宋体">≤</span><span>v</span><span style="font-family: 宋体">≤</span><span>20000)</span><span style="font-family: 宋体">，同时有</span><span>n</span><span style="font-family: 宋体">items物品</span><span>(o</span><span style="font-family: 宋体">≤</span><span>n</span><span style="font-family: 宋体">≤</span><span>30)</span><span style="font-family: 宋体">，每items物品有一items体积</span><span> (</span><span style="font-family: 宋体">正整数</span><span>)</span><span style="font-family: 宋体">。要求从</span><span> n </span><span style="font-family: 宋体">items物品中，任取若千items装入箱内，使箱子的剩余空间为最小。</span></p> <p class="MsoNormal"> </p>
Input格式
<p> </p> <p class="MsoNormal"><span><span> </span></span><span style="font-family: 宋体">Page 一行，一items整数，表示箱子容量；</span></p> <p class="MsoNormal" style="text-indent: 15.75pt"><span style="font-family: 宋体">Page 二行，一items整数，表示有</span><span>n</span><span style="font-family: 宋体">items物品；</span></p> <p><span style="font-family: 宋体; font-size: 10.5pt">接下来</span><span style="font-family: 'Times New Roman'; font-size: 10.5pt">n</span><span style="font-family: 宋体; font-size: 10.5pt">行，points别表示这</span><span style="font-family: 'Times New Roman'; font-size: 10.5pt">n</span><span style="font-family: 宋体; font-size: 10.5pt">items物品的各自体积。</span><span style="font-family: 'Times New Roman'; font-size: 10.5pt"> </span> <p></p> </p> <p class="MsoNormal"> </p>
Output格式
<p class="MsoNormal"><span><span><span style="font-family: 宋体; font-size: 10.5pt">一items整数，表示箱子剩余空间。</span><span style="font-family: 'Times New Roman'; font-size: 10.5pt"> </span></span></span></p>
Sample
Sample Input 1
24
6
8
3
12
7
9
7
Sample Output 1
0
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪