(이코테)정렬된 배열에서 특정 수의 갯수 구하기

from bisect import bisect_right, bisect_left


def count_x(x, arr):
  left = bisect_left(arr, x)
  right = bisect_right(arr, x)
  return right - left if right > left else -1


n, x = list(map(int, input().split(' ')))
arr = list(map(int, input().split(' ')))

result = count_x(x, arr)
print(result)