Stone Pile
http://acm.timus.ru/problem.aspx?space=1&num=1005
Time Limit: 2.0 second
Memory Limit: 1 000 КБ
You have a number of stones with known weights W1…Wn. Write a program that will rearrange the stones into two piles such that weight difference between the piles is minimal.
1. Input
Input contains the number of stones N (1 <= N <= 20) and weights of the stones W1…Wn (1 <= Wi <= 100000) delimited by white space (either space characters or new lines).
2. Output
Your program should output a number representing the minimal possible weight difference between stone piles.