Account
GitHubFeedback
Drafts and results saved on this device
Submit on CSES.fi
CSES Problemset/Sorting and Searching

Missing Coin Sum

#2183
Ask AI

Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.

Open Claude Desktop

Time limit:1.00 s
Memory limit:512 MB
Unsolved
Download Tests (.zip)

You have nn coins with positive integer values. What is the smallest sum you cannot create using a subset of the coins?

Input

The first line has an integer nn: the number of coins.

The second line has nn integers x1,x2,…,xnx_1,x_2,\dots,x_n: the value of each coin.

Output

Print one integer: the smallest coin sum.

Constraints
  • 1≤n≤2⋅1051 \le n \le 2 \cdot 10^5
  • 1≤xi≤1091 \le x_i \le 10^9
Sample Test Cases (1)
Example 1ID: sample-1
Input
5
2 9 1 2 7
Expected Output
6
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|1 line, 0 chars
Test Bench
Download .zip
Input (stdin)
5
2 9 1 2 7
Expected Output
6