I'm trying to solve this question:
Let S be a multi-set of n integers, can S be partitioned into two sub-multi-sets $S1$,$S2$, such that: $$ \sum_{x \in S1} x = \sum_{y \in S2} y $$
I'm trying to figure out how the answer should look like. I know I need a function $$ \sum_{i=1}^m CiXi$$ but I'm not sure how maximizing \ minimizing it would help. Also, I guess I should have constraints on $Xi$ but don't know what constraints they should be (I know they are integers). Can you pls point me in the right direction?