Find the smallest integer that cannot be represented as sum of any subset of sorted array

Find the smallest integer that cannot be represented as sum of any subset of sorted array - Coding Problem | K5kC