Occurrence of X in a Sorted Array Problem Statement

Given a sorted array of integers of size N and an integer X, determine the total number of occurrences of X in the array.

Input:

The first line of the input contains two integers N and X, representing the size of the array and the integer X, respectively.
The second line contains N space-separated integers representing the elements of the array.

Output:

Output a single integer representing the total number of times X occurs in the array.

Example:

Input:

5 2
1 2 2 2 3

Output:

3

Constraints:

• 1 <= N <= 105
• 1 <= Arr[i] <= 109 where Arr[i] is the ith element in the array.
• Time Limit: 1sec