Closest Pair Sum to Zero

Difficulty: 1400 3500 ms 128 MB

sorting two-pointers

Choose two elements minimizing |a_i + a_j|. Print that minimum absolute sum.

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

Output: min |a_i + a_j| over pairs.

Constraints:

• 2 ≤ N ≤ 10⁵
• |a_i| ≤ 10⁹

Sample Tests

4
-8 4 5 -10

3

2
3 3

6

Read the Editorial