python20分求调,只对了#6,五个RE
查看原帖
python20分求调,只对了#6,五个RE
1521764
JerryChan0116楼主2025/1/20 10:27
import bisect

n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
key = list(map(int,input().split()))

for j in range(m):
    i = bisect.bisect_left(a, key[j])
    if a[i] == key[j]:
        print(i+1,end=" ")
    else:
        print(-1,end=" ")
2025/1/20 10:27
加载中...