title: Minimum Sum Two Numbers Formed Digits Array 2
signature: minimumSumTwoNumbersFormedDigitsArray2 :: [Integer] -> Integer -> Integer
  minimumSumTwoNumbersFormedDigitsArray2 a n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Integer -> String
  driver a n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME a n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ([4, 16, 29, 30, 38, 83]) (5) (918) )
  
      printf "TEST-1...%s\n" (driver ([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 ([0, 1]) (1) (0) )
  
      printf "TEST-3...%s\n" (driver ([7, 12, 78, 8]) (3) (90) )
  
      printf "TEST-4...%s\n" (driver ([-78, -48, -48, -26, 8, 34]) (4) (-1334) )
  
      printf "TEST-5...%s\n" (driver ([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 ([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 ([0, 0, 0, 0, 0, 0, 1, 1, 1]) (8) (2) )
  
      printf "TEST-8...%s\n" (driver ([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) )
  
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;
  }