题号：NC243691
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
You now have an array 
and you can construct an array 
of any length, where each element is an element that has appeared in array . The set 
is all possible sums of the array , find the largest integer which is not in set .
输入描述:
The first line contains a single integerwhich is the size of array
The second line containsintegers
which is the element of the array
输出描述:
Output a single number - the maximun integer which is not in set.