title: Minimum Sum Two Numbers Formed Digits Array 2
signature: pub fn minimum_sum_two_numbers_formed_digits_array_2(a: Vec<i32>, n: i32) -> i64 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(a: Vec<i32>, n: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(a, n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([4, 16, 29, 30, 38, 83]), 5, 
        918
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 1]), 1, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([7, 12, 78, 8]), 3, 
        90
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-78, -48, -48, -26, 8, 34]), 4, 
        -1334
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([2, 3, 5, 7, 25, 30, 31, 38, 42, 45, 52, 53, 56, 59, 60, 71, 74, 76, 80, 90, 91, 98]), 13, 
        3190079
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 1, 1, 1]), 8, 
        2
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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;
  }