Balance with respect to an array

problem id:--http://practice.geeksforgeeks.org/problems/balance-with-respect-to-an-array/0

code:--

#include <bits/stdc++.h>

using namespace std;
#define ll   long long
#define      pii               std::pair<int,int>
#define      vi                std::vector<int>
#define      vll               std::vector<long long>
#define      mp(a,b)           make_pair(a,b)
#define      pb(a)             push_back(a)
#define sc(x)   scanf("%d",&x)
#define scll(x)   scanf("%lld",&x)
#define sc2(x,y)   scanf("%d%d",&x,&y)
#define sc3(x,y,z)   scanf("%d%d%d",&x,&y,&z)
#define     pf(x)   printf("%d ",x)
#define     pf2(x,y)   printf("%d %d ",x,y)
#define     pf3(x,y,z)   printf("%d %d %d ",x,y,z)
#define pfnl()   putchar('\n');
#define      each(it,s)        for(auto it = s.begin(); it != s.end(); ++it)
#define      rep(i, n)         for(int i = 0; i < (n); ++i)
#define rep2(i,j,n)   for(int i = j; i < (n); ++i)
#define      fill(a)           memset(a, 0, sizeof (a))
#define      sortA(v)          sort(v.begin(), v.end())
#define      sortD(v)          sort(v.begin(), v.end(), greater<auto>())
#define      X                 first
#define      Y                 second
#define gc() getchar()

#define debug(x) cerr<<"debug->"<<#x<<"::"<<x<<endl
#define debug2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n"
#define debug3(x,y,z) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n"
#define MOD 1000000007

template <typename T> void scan(T &angka){
angka=0;char input=gc();T kali=1;
while(!(48<=input&&input<=57)){ if(input=='-') kali=-1;input=gc();}
while(48<=input&&input<=57) angka=(angka<<3)+(angka<<1)+input-48,input=gc();angka*=kali;
}
int arr[(int)1e5+5];
int binary_floor(int num,int n)
{
int l=0,r=n,mid;
while(l<=r)
{
mid=(l+r)/2;
if(arr[mid]==num) return -1;
if(arr[mid]<num) l=mid+1;
else r=mid-1;
}
if(arr[mid]>num)   --mid; // here we double check the condition for floor  if its true then we decrease 1
return mid;
}

int binary_ceil(int num,int n)
{
int l=0,r=n,mid;
while(l<=r)
{
mid=(l+r)/2;
if(arr[mid]==num) return -1;
if(arr[mid]>num) r=mid-1;
else l=mid+1;
}
if(arr[mid]<num) ++mid;   // here we double check the condition if its true then we increase 1
return mid;
}

int main() {
string ans[]={"Not Balanced\n","Balanced\n"};
int t;
sc(t);
while(t--)
{
int n;
sc(n);
rep(i,n) sc(arr[i]);
int num;
sc(num);
bool flag;
if(num<arr[0] || num>arr[n-1]) flag=1;
else
{
int l,r;
l=binary_floor(num,n-1);
r=binary_ceil(num,n-1);
if(l==-1 || r==-1) flag=1;
else flag=(2*num==arr[l]+arr[r]);//This condition is equvalent to (x-floor(x))==(ceil(x)-x)
}
cout<<ans[flag];
}
return 0;
}