title: Split Array in two parts such that sum of gcd of both parts is maximum
body: <p>Split a array into two non empty parts such that sum of gcd of first part and second part is maximum</p>
  
  <p>I put largest element in first part and second largest in second part and then starting from the least elemnt among remaining check its GCD with each part and add it to a part having minimum loss in previous ans(sum of gcd upto now)</p>
  
  <p>I guess i am missiing some corner cases</p>