title: Find Smallest Value Represented Sum Subset Given Array
signature: def find_smallest_value_represented_sum_subset_given_array(arr, n):
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;
  }
question_info.test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(arr, n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              arr, n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver([16, 23, 24, 41, 48, 58, 72, 75], 4, 1)
      print(f"TEST-0...{result}")
  
      result = driver([-14, -82, 12, -14, -38, 12, 40, 12, -74, 42, -36, 64], 8, -95)
      print(f"TEST-1...{result}")
  
      result = driver([0, 0, 1, 1, 1, 1], 5, 4)
      print(f"TEST-2...{result}")
  
      result = driver([17, 89, 44], 2, 1)
      print(f"TEST-3...{result}")
  
      result = driver([-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)
      print(f"TEST-4...{result}")
  
      result = driver([0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0], 8, 2)
      print(f"TEST-5...{result}")
  
      result = driver([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)
      print(f"TEST-6...{result}")
  
      result = driver([-54], 0, 1)
      print(f"TEST-7...{result}")
  
      result = driver([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)
      print(f"TEST-8...{result}")
  
      result = driver([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)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
question_info.test_case_ids: ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']
question_info.entry_fn_name: find_smallest_value_represented_sum_subset_given_array
question_info.test_list: [{"idx": 0, "outputs": 1, "inputs": {"arr": [16, 23, 24, 41, 48, 58, 72, 75], "n": 4}}, {"idx": 1, "outputs": -95, "inputs": {"arr": [-14, -82, 12, -14, -38, 12, 40, 12, -74, 42, -36, 64], "n": 8}}, {"idx": 2, "outputs": 4, "inputs": {"arr": [0, 0, 1, 1, 1, 1], "n": 5}}, {"idx": 3, "outputs": 1, "inputs": {"arr": [17, 89, 44], "n": 2}}, {"idx": 4, "outputs": -93, "inputs": {"arr": [-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], "n": 25}}, {"idx": 5, "outputs": 2, "inputs": {"arr": [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0], "n": 8}}, {"idx": 6, "outputs": 1, "inputs": {"arr": [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], "n": 23}}, {"idx": 7, "outputs": 1, "inputs": {"arr": [-54], "n": 0}}, {"idx": 8, "outputs": 12, "inputs": {"arr": [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], "n": 33}}, {"idx": 9, "outputs": 1, "inputs": {"arr": [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], "n": 35}}]
question_info.entry_cls_name: Solution