[Algorithms] 결정&그리디 알고리즘-이분 탐색

n, m = map(int, input().split())
ar = list(map(int, input().split()))
 
 
def binary_search(ar, num):
    first, last = 0, len(ar)-1
 
    while first<=last:
        mid = (first+last)//2
        if ar[mid] == num:
            return mid+1
        elif ar[mid] < num:
            first=mid+1
        else:
            last=mid-1
 
 
ar.sort()
num_idx=binary_search(ar, m)
print(num_idx)