Kolikot

import java.util.Arrays;
import java.util.Scanner;

public class Kolikot
{
    static int[] coinValues;
    
    public static void main(String[] args)
    {
        Scanner inputTaker = new Scanner(System.in);
        int amountOfCoins = inputTaker.nextInt();
        inputTaker.nextLine();
        String coinsString = inputTaker.nextLine();
        
        int[] coins = new int[amountOfCoins];
        
        /*Now the input is handled into an array*/
        int arraysOrdinal = 0;
        StringBuilder coin = new StringBuilder();
        for(int i = 0; i < coinsString.length(); i++)
        {
            if(("" + coinsString.charAt(i)).matches("[0-9]"))
            {
                coin.append(coinsString.charAt(i));
            }
            else
            {
                coins[arraysOrdinal] = Integer.parseInt(coin.toString());
                coin = new StringBuilder();
                arraysOrdinal++;
            }
            
            if(i == coinsString.length() - 1)
            {
                coins[arraysOrdinal] = Integer.parseInt(coin.toString());
            }
        }
        
        Arrays.sort(coins);
        coinValues = coins;
        
        /*Now begins the actual calculation for the first unpresentable number*/
        for(int i = 1; true; i++)
        {
            int coinFound = -1;
            /*coinFound is the coin that proves that i can be presented as a sum
            of some coins. If it remains as -1 after the second for-loop, no
            coin is found and the current i cannot be presented as a sum of
            coins.*/
            
            for(int j = 1; j <= i; j++)
            {
                int index = Arrays.binarySearch(coins, j);
                if(index >= 0)
                {
                    int firstIndex = firstIndexOf(j, index);
                    coinFound = coins[firstIndex];
                    coins[firstIndex] = 0;
                    break;
                }
            }
            
            if(coinFound != -1)
            {
                i += (coinFound - 1);
            }
            else
            {
                System.out.println(i);
                break;
            }
        }
    }
    
    public static int firstIndexOf(int numberSearched, int someIndex)
    {
        int firstIndex = someIndex;
        for(int i = someIndex - 1; true; i--)
        {
            try
            {
                if(coinValues[i] == numberSearched) firstIndex = i;
                else return firstIndex;
            }
            catch(Exception e)
            {
                return firstIndex;
            }
        }
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED