TechoSagar: Balanced Array

Balanced Array

Given an array of even size, task is to find minimum value that can be added to an element so that array become balanced. An array is balanced if the sum of the left half of the array elements is equal to the sum of right half.
Input:
The first line of input contains an integer T denoting the number of test cases. Each test case contains the number of elements in the array a[] as n and next line contains space separated n elements in the array a[].

Output:
Print an integer which is the required answer.

Constraints:
1<=T<=20
2<=n<=10000
1<=a[i]<=100000

Example:
Input:

2
6
1 2 1 2 1 3
2
20 10
Output:
2
10
Explanation:
Suppose, we have an array 1 2 1 2 1 3. The Sum of first three elements is 1 + 2 + 1 = 4 and sum of last three elements is 2 + 1 + 3 = 6
So this is unbalanced, to make it balanced the minimum number we can add is 2 to any element in first half.
Your Code 
#include<iostream>
#include<math.h>
#include <stdlib.h> 
using namespace std;

int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int a[10000];
int i;
for(i=0; i<n; i++)
{
cin>>a[i];
}
int sum=0, sum1=0;
for(i=0; i<n/2; i++)
{
  sum=sum+a[i];
  sum1=sum1+a[n-i-1];
}
int d=sum-sum1;
int ans=abs(d);
cout<<ans<<endl;
}
}
 


Follow us

Follow Bijendra Kumar on Facebook