Python刷OJ———UVa :10474 Where is the Marble?

首先说一下，本人没有投身ACM的想法，刷题完全是当练习，有些题能accept，其余基本都是LTE。。讲真的，全网太难找到用python实现的代码了，而我就是如此倔强，于是放一些题的代码在博客上，纯属爱好，大家不要当真哈哈哈哈。
————————————————————————————————————————————

题目：

Raju and Meena love to play with Marbles. They have got a lot of
marbles with numbers written on them. At the beginning, Raju would
place the marbles one after another in ascending order of the numbers
written on them. Then Meena would ask Raju to find the first marble
with a certain number. She would count 1…2…3. Raju gets one point
for correct answer, and Meena gets the point if Raju fails. After some
fixed number of trials the game ends and the player with maximum
points wins. Today it’s your chance to play as Raju. Being the smart
kid, you’d be taking the favor of a computer. But don’t underestimate
Meena, she had written a program to keep track how much time you’re
taking to give all the answers. So now you have to write a program,
which will help you in your role as Raju.

Input：

There can be multiple test cases. Total no of test cases is less than 65. Each test case consists begins with 2 integers: N the number of marbles and Q the number of queries Mina would make. The next N lines would contain the numbers written on the N marbles. These marble numbers will not come in any particular order. Following Q lines will have Q queries. Be assured, none of the input numbers are greater than 10000 and none of them are negative. Input is terminated by a test case where N = 0 and Q = 0

Output：

For each test case output the serial number of the case.
For each of the queries, print one line of output. The format of this line will depend upon whether
or not the query number is written upon any of the marbles. The two different formats are described
below:
• ‘x found at y’, if the first marble with number x was found at position y. Positions are numbered
1, 2, . . . , N.
• ‘x not found’, if the marble with number x is not present.
Look at the output for sample input for details.

Sample Input
4 1
2
3
5
1
5
5 2
1
3
3
3
1
2
3
0 0
Sample Output
CASE# 1:
5 found at 4
CASE# 2:
2 not found
3 found at 3
————————————————————————————————————————————
大体意思就是先给一个整数 N 和 Q ，接下来将会再给 N 个整数，然后你要把他们从小到大排序。然后再给你 Q 个整数，让你找这 Q 个整数是否在 N 中存在，存在和不存在都有对应的输出，见示例

思路：
一个排序，一个查找。排序的话一般快排就可以，既然是有序数列，那肯定是二分法查找
我自己的想法是，对于每一组数据，先把 N 个数和 Q 个数全都接收完（用列表）。然后排序，写一个二分查找的函数。然后用map（）直接并行找所有 Q 中的数。最后将返回结果输出即可。

上代码

from sys import stdin, setr