title: Find Smallest Value Represented Sum Subset Given Array
signature: func findSmallestValueRepresentedSumSubsetGivenArray(arr []int, n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr []int, n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{16, 23, 24, 41, 48, 58, 72, 75}, 
  	4, 1)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{-14, -82, 12, -14, -38, 12, 40, 12, -74, 42, -36, 64}, 
  	8, -95)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 1, 1, 1, 1}, 
  	5, 4)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{17, 89, 44}, 
  	2, 1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-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)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0}, 
  	8, 2)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{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)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-54}, 
  	0, 1)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{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)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{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)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }