Minimum difference - MarisaOJ: Marisa Online Judge

You are given an array

A

$A$ of

n

$n$ integers. Divide

A

$A$ into 2 sets of numbers so that the absolute difference in their sum is as small as possible. ### Input - The first line contains an integer

n

$n$ . - The second line contains

n

$n$ integers

A_{i}

$A_i$ . ### Output - Print the minimum difference. ### Constraints -

1 \leq n \leq 40

$1 \le n \le 40$ . -

- 10^{9} \leq A_{i} \leq 10^{9}

$-10^9 \le A_i \le 10^9$ . ### Example Input:

3124

$3 1 2 4$

Output:

1

$1$

Topic

Meet in the middle

Rating

900

Solution (0)

Solution