编程介的小学生 2017-04-22 03:46 采纳率: 0.2%
浏览 772
已采纳

Kindergarten Day

Octorber 1 is the Kindergarten Day on which college students volunteer to work at kindergartens across the country. As you have gathered the kids you decide to assign them some mission impossible so that you can take a nap. You gave them a huge pile of numbers and ask them to sort them from the biggest to the smallest, and pick the kth number for you.

What amazed you most is that the kids took out their notebooks to start programming. You realized they would come back in a while for the answers. As there are a few kids you need a program that beats their sorting program (whatever algorithm it depends on).

Input

Each case starts by two integers n and m, where n*n is the number of integers you gave them, and m is the number of kids (each of them is assigned a different k). (0 < n <= 1000, 0 < m <= 20)

The second line contains n integers, and the original data is obtained by multiple each pair of the n numbers. (Yes they could overflow, but just rely on the overflow behavior of a 32-bit signed integer).

The third line contains m integers, each of which in the range from 1 to n*n, which are the tasks you assigned the kids.

A case with n = 0 terminates the input.

Output

For each test case print m numbers on a single line separated by a space, which are the answers for the m kids.

Sample Input
1 1
1
1
2 2
1 2
2 4
0 0
Sample Output
1
2 1

展开全部

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-05-06 07:53
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
编辑
预览

报告相同问题?

悬赏问题

  • ¥15 fluentmeshing
  • ¥15 手机/平板的浏览器里如何实现类似荧光笔的效果
  • ¥15 盘古气象大模型调用(python)
  • ¥15 传人记程序做的plc 485从机程序该如何写
  • ¥15 已知手指抓握过程中掌指关节、手指各关节和指尖每一帧的坐标,用贝塞尔曲线可以拟合手指抓握的运动轨迹吗?
  • ¥50 libwebsockets 如何添加其他socket事件回调
  • ¥50 实现画布拖拽算子排布,通过flink实现算子编排计算,请提供思路
  • ¥15 esium自定义材质拉伸问题
  • ¥15 cmake+mingw使用<mysqlx/xdevapi.h>报错
  • ¥15 eNSP中防火墙的使用
手机看
程序员都在用的中文IT技术交流社区

程序员都在用的中文IT技术交流社区

专业的中文 IT 技术社区,与千万技术人共成长

专业的中文 IT 技术社区,与千万技术人共成长

关注【CSDN】视频号,行业资讯、技术分享精彩不断,直播好礼送不停!

关注【CSDN】视频号,行业资讯、技术分享精彩不断,直播好礼送不停!

客服 返回
顶部