Kolikot

import java.util.Scanner;
import java.util.Arrays;
public class kolikot {

    public static void main (String[] args) {
        Scanner scanner = new Scanner(System.in);
        int i = scanner.nextInt();
        long[] nums = new long[i];
        for (int j = 0; j < i; j++) {
            nums[j] = scanner.nextLong();
        }
        Arrays.sort(nums);
        long c = 1;
        for (int j = 0; j < nums.length; j++) {
            if (nums[j] > c) {
                break;
            } else {
                c = c + nums[j];
            }
        }
        System.out.println(c);
    }
}

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: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED