Algorithm to separate a vector into two others

Hello !

I have a question.

I need to make an algorithm to separate a vector of 2*n ints into two vector of n ints, but the sum of both vectors (absolute) must be the lowest.

__Example :__

Code:

`The "big" vector : 1000 2 3 4 5 6 7 2000`

n = 4

The two vectors must be :

- 2000 2 3 4 ; sum = 2009

- 1000 5 6 7 ; sum = 1018

abs(2009 - 1018) = 991 (which is the lowest)

I searched all the web to find an algorithm like this, but i didn't found it.

If you can help me, it would be very nice :)