Classic
Clean & simple
Crystal
Glassmorphism + Neon
Cyberpunk
Neon glitch art
🚫
违规Action检测
禁止Use右键菜单
⚠️ 此Action已被系统记录
1

排队打水问题

📝 Solutions 🔵 仅限 C++
Problems Description
&nbsp; <p style="text-align:left;vertical-align:baseline;"> <span style="font-family:Arial;color:black;font-size:20pt;"><span>&nbsp;&nbsp;&nbsp; </span></span><span style="font-family:宋体;color:black;font-size:20pt;">有</span><span style="font-family:Arial;color:black;font-size:20pt;">n</span><span style="font-family:Arial;color:black;font-size:20pt;">(n&lt;=100)</span><span style="font-family:宋体;color:black;font-size:20pt;">items</span><span style="font-family:宋体;color:black;font-size:20pt;">人在一items水龙头前排队接水,假如每items人接水的时间为</span><span style="font-family:Arial;color:black;font-size:20pt;">Ti</span><span style="font-family:Arial;color:black;font-size:20pt;">(Ti&lt;=1000)</span><span style="font-family:宋体;color:black;font-size:20pt;">,</span><span style="font-family:宋体;color:black;font-size:20pt;">请编程找出这</span><span style="font-family:Arial;color:black;font-size:20pt;">n</span><span style="font-family:宋体;color:black;font-size:20pt;">items人排队的一种顺序,使得</span><span style="font-family:Arial;color:black;font-size:20pt;">n</span><span style="font-family:宋体;color:black;font-size:20pt;">items人的平均等待时间最小。</span><span style="font-family:Arial;color:black;font-size:20pt;font-weight:bold;"> </span> </p>
Input格式
&nbsp; <p style="text-align:left;vertical-align:baseline;"> <span style="font-family:Arial;color:black;font-size:20pt;"><span>&nbsp;&nbsp;&nbsp; </span></span><span style="font-family:宋体;color:black;font-size:20pt;">输入FileTotal两行,Page 一行为</span><span style="font-family:Arial;color:black;font-size:20pt;">n</span><span style="font-family:宋体;color:black;font-size:20pt;">;Page 二行points别表示Page </span><span style="font-family:Arial;color:black;font-size:20pt;">1</span><span style="font-family:宋体;color:black;font-size:20pt;">items人到Page </span><span style="font-family:Arial;color:black;font-size:20pt;">n</span><span style="font-family:宋体;color:black;font-size:20pt;">items人每人的接水时间</span><span style="font-family:Arial;color:black;font-size:20pt;">T1</span><span style="font-family:宋体;color:black;font-size:20pt;">,</span><span style="font-family:Arial;color:black;font-size:20pt;">T2</span><span style="font-family:宋体;color:black;font-size:20pt;">,</span><span style="font-family:Arial;color:black;font-size:20pt;">…</span><span style="font-family:宋体;color:black;font-size:20pt;">,</span><span style="font-family:Arial;color:black;font-size:20pt;">Tn</span><span style="font-family:宋体;color:black;font-size:20pt;">,每items数据之间有</span><span style="font-family:Arial;color:black;font-size:20pt;">1</span><span style="font-family:宋体;color:black;font-size:20pt;">items空格。</span><span style="font-family:Arial;color:black;font-size:20pt;font-weight:bold;"> </span> </p>
Output格式
&nbsp; <p style="text-align:left;vertical-align:baseline;"> <span style="font-family:Arial;color:black;font-size:20pt;"><span>&nbsp;&nbsp;&nbsp; </span></span><span style="font-family:宋体;color:black;font-size:20pt;">输出File有两行,Page 一行为一种排队顺序,即</span><span style="font-family:Arial;color:black;font-size:20pt;">1</span><span style="font-family:宋体;color:black;font-size:20pt;">到</span><span style="font-family:Arial;color:black;font-size:20pt;">n</span><span style="font-family:宋体;color:black;font-size:20pt;">的一种排列;Page 二行为这种排列方案下的平均等待时间</span><span style="font-family:Arial;color:black;font-size:20pt;">(</span><span style="font-family:宋体;color:black;font-size:20pt;">输出结果精确到小数点后两位</span><span style="font-family:Arial;color:black;font-size:20pt;">)</span><span style="font-family:宋体;color:black;font-size:20pt;">。</span><span style="font-family:Arial;color:black;font-size:20pt;font-weight:bold;"> </span> </p>
Sample
Sample Input 1
10 56 12 1 99 1000 234 33 55 99 812
Sample Output 1
3 2 7 8 1 4 9 6 10 5 532.00
Submit Code
请先Login后Submit

🤖 AI 解题助手

OpenRouter
就绪
👋 你好!我是 AI 解题助手。
我已阅读了这problems题,可以帮你points析思路、提供Code示例。
🔓 完全Free · 无需消耗 Token