Sum of two#11244
Given an array sorted in ascending order and containing integers, determine whether there exists a pair of numbers (A_i, A_j) where i < j, such that their sum is equal to .
The first line contains two integers (n \le 10^5) and (x \le 10^6). The second line contains non-negative integers, each not greater than 10^6.
Print "YES" if such a pair of elements exists, and "NO" otherwise.
Example 1
Example 2