提出 #27849694

---

ソースコード 拡げる

def binary_search(data, value):
    left = 0
    right = len(data)-1
    while left <= right:
        mid = (left + right)//2
        if mid == len(data)-1:
            if data[mid] >= value:
                return len(data)
            else:
                return len(data)-1
        if data[mid] >= value > data[mid+1]:
            return mid+1
        elif value > data[mid]:
            right = mid-1
        else:
            left = mid+1
    return 0

n, q = map(int, input().split())
a = list(map(int, input().split()))
x = [int(input()) for _ in range(q)]

a_sort = sorted(a, reverse=True)

for i in range(q):
    print(binary_search(a_sort, x[i]))

提出情報

ジャッジ結果