Problem

1 /10


How to share a potato

Problem

Vasya and Petya went to dig potatoes. At the end of the day they dug up N sacks of potatoes weighing W1, W2, ... WN. How can they divide the sacks of potatoes among themselves so that the mass difference is minimal.
Input
On the first line  the number N is written – number of bags (1 ≤ N ≤ 18). The second line lists the masses of bags W1, W2 , … WN (1 ≤ Wi ≤ 105).
 
Output
On a single line, print one non-negative integer – the minimum possible difference between the masses of two heaps with bags.
 
Input Output
5
5 3 5 7 8 		2

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!