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

排序

📝 Solutions 🔵 仅限 C++
Problems Description
<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">现有一items一维的数轴,给出<span>n</span><span>items整数代表数轴上的点,再给一items</span><span>m</span><span>点,把这</span><span>n</span><span>items点按照离</span><span>m</span><span>点的距离从小到大排序。</span></span> </p>
Input格式
<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">Page 一行一items整型<span>t</span><span>,代表有</span><span>t</span><span>组测试数据。每组测试数据Page 一行为</span><span>n</span><span> m</span><span>,points别代表有</span><span>n</span><span>items点和坐标轴上一items点的坐标。Page 二行为</span><span>n</span><span>items整数,代表</span><span>n</span><span>items点的坐标(</span><span>t</span><span>不大于</span><span>100</span><span>,</span><span>n</span><span>和</span><span>m</span><span>的绝对值不大于</span><span>1000</span><span>)。</span></span> </p>
Output格式
<p class="p0"> <span style="font-size:10.5000pt;font-family:'宋体';">把这<span>n</span><span>items点按照离</span><span>m</span><span>点的距离从小到大排序,如果有两items点离</span><span>m</span><span>点的距离相同,则应按n坐标从小到大顺序输出。</span></span> </p>
Sample
Sample Input 1
1 5 3 7 2 -1 3 8
Sample Output 1
3 2 -1 7 8
Submit Code
请先Login后Submit

🤖 AI 解题助手

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