BETA

Difficulty Level:

Medium

Total Submissions: 848 Accuracy:

14.03%

Smallest Non-Zero Number
     

Given an array of size n your goal is to find a number such that when the number is processed against each array element starting from the 0th index till the (n-1)-th index under the conditions given below, it never becomes negative.

  1. If the number is greater than an array element, then it is increased by difference of the number and the array element.
  2. If the number is smaller than an array element, then it is decreased by difference of the number and the array element.

Input:
First line consists of T, test cases. First line of every test case consists of N, denoting number of elements in array. Second line consists of elements of array.

Output:
Single line output, print the smallest possible number.

Constraints:
1<=T<=100
1<=N<=10^4

Example:
Input:

2
5
3 4 3 2 4
5
1 2 3 4 5
Output:
4
2

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

Contributor: Saksham Raj Seth

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

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