https://stackoverflow.com/questions/29247004/finding-the-maximum-sum-that-can-be-formed-from-a-set-by-partitioning-it-into-t

Given a set of numbers S. Find maximum sum such that Sum(A1) = Sum(A2) Where, A1⊂S and A2⊂S and A1⋂A2=∅ And Sum(X), is the sum of all elements within the set X

in cpp :)

thanks in advance !

test case# 25 elements --> 5 27 24 12 12 2 15 25 32 21 37 29 20 9 24 35 26 8 31 5 25 21 28 3 5 ans=239