Smallest Missing Coin Sum

You may select any subset of the supplied coins. Each individual coin may be used at most once, even when multiple coins share a value. Find the smallest positive integer amount that no selection can produce.

Implement missing_coin_sum(coins).

Input

coins: The values of the available coins; duplicates represent separate coins.

Output

Return the smallest positive impossible amount.

Contraintes

1 ≤ number of coins ≤ 200,000. Each value is between 1 and 1,000,000,000.

Exemples

Entrée :
coins = [1, 1, 4]

Sortie attendue :
expected = 3

Entrée :
std::vector<long long> coins = {1, 1, 4};

Sortie attendue :
long long expected = 3;

Entrée :
long[] coins = new long[] {1, 1, 4};

Sortie attendue :
long expected = 3;

Entrée :
coins = [2, 3]

Sortie attendue :
expected = 1

Entrée :
std::vector<long long> coins = {2, 3};

Sortie attendue :
long long expected = 1;

Entrée :
long[] coins = new long[] {2, 3};

Sortie attendue :
long expected = 1;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Missing Coin Sum — 2183