7512: [CSES Problem Set] Missing Coin Sum
[Creator : ]
Description
You have $n$ coins with positive integer values.
What is the smallest sum you cannot create using a subset of the coins?
What is the smallest sum you cannot create using a subset of the coins?
Input
The first input line has an integer $n$: the number of coins.
The second line has $n$ integers $x_1,x_2,…,x_n$: the value of each coin.
The second line has $n$ integers $x_1,x_2,…,x_n$: the value of each coin.
Output
Print one integer: the smallest coin sum.
Constraints
$1≤n≤2⋅10^5$
$1≤x_i≤10^9$
$1≤x_i≤10^9$
Sample 1 Input
5
2 9 1 2 7
Sample 1 Output
6