title: Find Smallest Value Represented Sum Subset Given Array
signature: pub fn find_smallest_value_represented_sum_subset_given_array(arr: Vec<i32>, n: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([16, 23, 24, 41, 48, 58, 72, 75]), 4, 
        1
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-14, -82, 12, -14, -38, 12, 40, 12, -74, 42, -36, 64]), 8, 
        -95
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 0, 1, 1, 1, 1]), 5, 
        4
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([17, 89, 44]), 2, 
        1
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-94, -92, -84, -82, -72, -58, -56, -40, -34, -34, -24, -22, -8, -8, 12, 14, 16, 16, 22, 22, 34, 46, 54, 58, 68, 72, 74, 78, 88, 96]), 25, 
        -93
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0]), 8, 
        2
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([2, 12, 13, 13, 13, 16, 28, 32, 34, 41, 41, 47, 49, 49, 50, 52, 58, 61, 63, 65, 67, 68, 68, 74, 80, 80, 84, 84, 89, 93, 94, 98, 99, 99]), 23, 
        1
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([-54]), 0, 
        1
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), 33, 
        12
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([42, 50, 76, 45, 6, 63, 46, 73, 65, 70, 87, 5, 41, 63, 96, 75, 38, 76, 27, 7, 71, 9, 65, 44, 76, 37, 94, 52, 55, 3, 38, 68, 45, 15, 35, 90, 36, 46, 13, 92, 32, 22, 49, 35, 83]), 35, 
        1
      ));
      
  }
source_py: def find_smallest_value_represented_sum_subset_given_array(arr, n):
      res = 1
      for i in range(0, n):
          if (arr[i] <= res):
              res = (res + arr[i])
          else:
              break
      return res
source_cpp: int find_smallest_value_represented_sum_subset_given_array(vector<int> arr, int n) {
    int res = 1;
    for ( int i = 0;
    i < n && arr [ i ] <= res;
    i ++ ) res = res + arr [ i ];
    return res;
  }