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

Yeah, it is. But for max input (array of 10^6 elements) its fucking slow