To solve this problem, use brute force search.
Just generate all the subsets of the given set of stones. For each subset, calculate S=W1-W2, where  W1 is the total weight of the subset, W2 is the total weight of the remaining stones. Select the minimal I.