title: Minimum Sum Two Numbers Formed Digits Array 2
signature: function minimumSumTwoNumbersFormedDigitsArray2($a, $n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($a, $n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($a, $n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(4, 16, 29, 30, 38, 83), 5, 
        918));
      
      printf("TEST-1...%s\n",driver(
        array(58, 74, -28, -60, -6, 66, -76, 46, 0, -24, 28, -16, -14, 24, -94, -56, -80, 40, -18, -68, -8, -94, -88, -12, -20, -8), 16, 
        -2063616120));
      
      printf("TEST-2...%s\n",driver(
        array(0, 1), 1, 
        0));
      
      printf("TEST-3...%s\n",driver(
        array(7, 12, 78, 8), 3, 
        90));
      
      printf("TEST-4...%s\n",driver(
        array(-78, -48, -48, -26, 8, 34), 4, 
        -1334));
      
      printf("TEST-5...%s\n",driver(
        array(1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0), 27, 
        2222222));
      
      printf("TEST-6...%s\n",driver(
        array(2, 3, 5, 7, 25, 30, 31, 38, 42, 45, 52, 53, 56, 59, 60, 71, 74, 76, 80, 90, 91, 98), 13, 
        3190079));
      
      printf("TEST-7...%s\n",driver(
        array(0, 0, 0, 0, 0, 0, 1, 1, 1), 8, 
        2));
      
      printf("TEST-8...%s\n",driver(
        array(59, 9, 3, 20, 83, 87, 48, 4, 86, 67, 89, 96, 17, 36, 39, 45, 99, 8, 56, 92, 63, 81, 7, 75, 32, 10, 71, 82, 97, 92, 65, 23, 22, 47, 70, 79, 57, 81, 65, 50), 35, 
        430183530665338166));
      
  }
  
  main();
  ?>
source_py: def minimum_sum_two_numbers_formed_digits_array_2(a, n):
      a = sorted(a)
      (num1, num2) = (0, 0)
      for i in range(n):
          if ((i % 2) == 0):
              num1 = ((num1 * 10) + a[i])
          else:
              num2 = ((num2 * 10) + a[i])
      return (num2 + num1)
source_cpp: int minimum_sum_two_numbers_formed_digits_array_2(vector<int> a, int n) {
    sort(a.begin(), a.end());
    int num1 = 0;
    int num2 = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ];
      else num2 = num2 * 10 + a [ i ];
    }
    return num2 + num1;
  }