Balanced partition

Given an array of integers between 0 and M divide the integers into two sets such that the difference of their sum is minimized