Educational Codeforces Round 137 (Rated for Div. 2) (C. Save the Magazines)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll tst,n;

    cin>>tst;

    while(tst--)

    {

        vector<ll>vec;

        string str;

        cin>>n>>str;

        ll arr[n+9],flag=0,ans=0;

        for(ll i=0; i<n; i++)

            cin>>arr[i];

        for(ll i=n-1; i>=0; i--)

        {

            if(str[i]=='0')

            {

                vec.push_back(arr[i]);

                sort(vec.begin(),vec.end());

                for(ll j=1; j<vec.size(); j++)

                    ans+=(vec[j]);

                vec.clear();

                flag=0;

            }

            else

            {

                vec.push_back(arr[i]);

                flag=1;

            }

        }

        sort(vec.begin(),vec.end());

        for(ll j=0; j<vec.size(); j++)

            ans+=(vec[j]);

        vec.clear();

        cout<<ans<<endl;

    }

    return 0;

}

///Alhamdulillah

Problem Link:https://codeforces.com/problemset/problem/1743/C