IZhO 2017 - Bank

Time Complexity: $\mathcal{O}(M{2}^M)$

1int N,M;
2bitset<1<<20> dp;
3
4int main() {
5    setIO(); re(N,M);
6    vi a(N), b(M); re(a,b);
7    vi cum{0}; trav(t,a) cum.pb(cum.bk+t);
8    dp[0] = 1;
9    F0R(i,1<<M) if (dp[i]) {
10        int sum = 0;