经典简约
清爽简洁,回归本真
液态水晶
毛玻璃+霓虹光带
赛博朋克
霓虹故障艺术风
🚫
违规操作检测
禁止使用右键菜单
⚠️ 此操作已被系统记录
1

棍子

📝 题解 🔵 仅限 C++
题目描述
<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">这里有<span>n</span><span>个木棍,我们已知它们的长度和重量。这些棍子会一个接一个在机器中加工,把棍子放入需要些时间</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">,称作设置时间。这些设置时间花费在清理设备和改变工具,形状。</span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">设置机器时间需要:</span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">1.<span>设置第一个木棍需要</span><span>1</span><span>分钟</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">2.<span>之后加工设木棍的长度</span><span>l</span><span>和重量</span><span>w</span><span>,如果后面的木棍</span><span>l'(</span><span>前面的木棍</span><span>)&lt;=l</span><span>和</span><span>w'&lt;=w</span><span>则不需要加工时间,否则需要一分钟。</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">你需要找到设置<span>n</span><span>个木棍所需设置时间最少。例如,你有</span><span>5</span><span>根木棍他们都长度和重量分别为</span><span>(4,9),&nbsp;(5,2),</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">&nbsp;(2,1),&nbsp;(3,5),&nbsp;<span>和&nbsp;</span><span>(1,4)</span><span>,他们所需最少时间为</span><span>2</span><span>分钟,按照&nbsp;</span><span>(1,4),&nbsp;(3,5),&nbsp;(4,9),&nbsp;(2,1),&nbsp;(5,2).&nbsp;</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p>
输入格式
<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">输入格式:</span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">第一行<span>T</span><span>表示</span><span>T</span><span>个案例。每组案例有</span><span>2</span><span>行,第一行为一个整数</span><span>n</span><span>,</span><span>1&lt;=n&lt;=5000,</span><span>表示有</span><span>n</span><span>个木棍,第</span><span>2</span><span>行有</span><span>2n</span><span>个整数</span><span>l1,w1,</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">l2,w2.....l,w<span>最多为</span><span>10000</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p>
输出格式
<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">输出格式<span>:</span></span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p> <p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">每行含有每组最少的设置时间。</span><span style="font-size:10.5000pt;font-family:'宋体';"></span> </p>
样例
样例输入 1
3 5 4 9 5 2 2 1 3 5 1 4 3 2 2 1 1 2 2 3 1 3 2 2 3 1
样例输出 1
2 1 3
提交代码
请先登录后提交

🤖 AI 解题助手

DeepSeek
就绪
👋 你好!我是 AI 解题助手。
我已阅读了这道题,可以帮你分析思路、提供代码示例。
⚠️ 请先登录后使用