BETA
Two numbers with sum closest to zero
Submissions: 13165   Accuracy:

27.12%

  Difficulty: Easy

Given an integer array A of N elements. You need to find the sum of two elements such that sum is closest to zero.

Input:
The first line of input contains an integer T denoting the number of test cases.  
The first line of each test case is N, denoting the size of array. Each test case consist of a N integers which are the array elements.

Output:
Print the two numbers in ascending order such that their sum is closest to zero.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 103
-106 ≤ a[i] ≤ 106

Example:
Input
:
3
3
-8 -66 -60  
6
-21 -67 -37 -18 4 -65  
2
-24 -73

Output:
-68
-14
-97

Explanation:
Testcase 1: Sum of two elements closest to zero is -68 using numbers -60 and -8.

** For More Input/Output Examples Use 'Expected Output' option **

Author: jain_rishabh


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.