Algorithm

There's a n-element array of integers- 1 or 2.
We have to find subsequence which sum equals x.
How to do that ? I have no fucking idea.
Inb4 bruteforce

>>18
No, this doesn't work.
Let the input be {2 1 2} and let x = 4.  This algorithm will not find a solution.