C - Save the Magazines.cpp

#include <bits/stdc++.h>

using namespace std;

const int MX = 2e5 + 5;

int t, n, a[MX];
long long int dp[MX][2];
string s;

int main(){
    cin.tie(nullptr), ios::sync_with_stdio(false);
    cin >> t;
    while(t--){
        cin >> n >> s;
        for(int i = 1; i <= n; i++) cin >> a[i];
        for(int i = 1; i <= n; i++){
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
            dp[i][1] = 0;
            if(s[i - 1] == '1'){
                dp[i][1] = max(dp[i - 1][0], dp[i - 1][1]) + a[i];
                dp[i][0] = max(dp[i][0], dp[i - 1][0] + a[i - 1]);
            }
        }

        cout << max(dp[n][0], dp[n][1]) << "\n";
    }

}