Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
You have n
coins with positive integer values.
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 x1,x2,…,xn
: the value of each coin.
Output
Print one integer: the smallest coin sum.
Constraints
Example
Input:
5
2 9 1 2 7
Output:
6
Для отправки решений необходимо выполнить вход.
|