Solved Problem - Pair Sum

Problem statement

Given a sorted array of $N$ integers $A[]$. Find if there exist a pair of integers $A[i]$ and $A[j]$ such that the sum is equal to the given integer $X$.

Input format

The first line of input consists of two space-separated integers $N(1 \leq N \leq 10^{5})$ and $X(1 \leq X \leq 10^{6})$ ...