Three That Sum to T

Difficulty: 1500 3500 ms 128 MB

sorting two-pointers

Do three DIFFERENT positions exist with a_i + a_j + a_k = T?

Input: the first line has N and T; the second line has N integers.

Output: YES or NO.

Constraints:

• 3 ≤ N ≤ 2000
• |a_i|, |T| ≤ 10⁹

Sample Tests

5 9
2 7 4 1 5

NO

3 100
1 2 3

NO

Read the Editorial