/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Wrong Answer 6ms 832.0 KiB
#3 Wrong Answer 8ms 540.0 KiB

Code

///********************** Bismillahir Rahmanir Rahim *****************///
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
///************************** Area of spybit *************************///
/*
                             01    01
                            1010101010
                           010101010101
                        110101010101010101
                           0          0
                          0            0
                          0     **     0
                           0          0
                            0        0
                        *1111000000001111*
                        010            010
                        010            010
                        010            010
                        010            010
                        010            010
                        010            010
                              #spybit
*/
///*********************** Template Start Here ***********************///
///************************ C o n t a i n e r ************************///
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef set<int> si;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef tree< long long, null_type, less_equal<long long>, rb_tree_tag,tree_order_statistics_node_update > ordered_set;

///**************************** M a r c o ****************************///
#define f first
#define s second
#define endl '\n'
#define sp <<" "<<
#define pb push_back
#define MOD 1000000007
#define gcd(a,b) __gcd(a,b)
#define fora(a) for(auto u:a)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define test int tc; cin>>tc; while(tc--)
#define forn(i,k,n) for(auto i=k; i<n; i++)
#define printm(a) {for(auto u:a) cout<<u.f sp u.s<<endl;}
#define printv(a) {for(auto u:a) cout<<u<<" "; cout<<endl;}
#define abid() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction(a) cout.unsetf(ios::floatfield); cout.precision(a); cout.setf(ios::fixed,ios::floatfield);

///**************************** C o n s t ****************************///
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 900000000000000000;

///************************ Template End Here ************************///

int main()
{
    abid();

    test
    {
        int n,m;
        cin>>n>>m;

        string s;
        cin>>s;

        vector<int> v;
        int c = 0;
        fora(s)
        {
            if(u=='1') c++;
            else
            {
                if(c>0) v.pb(c);
                c = 0;
            }
        }
        if(c>0) v.pb(c);
        if(v.empty()) cout<< 0<<endl;
        else
        {
            sort(rall(v));
            int ans = 0;
            forn(i,0,min(n, m+1)) ans += v[i];
            cout<< ans<<endl;
            cout<< endl;
        }
    }

    return 0;
}



Information

Submit By
Type
Submission
Problem
P1159 Binary String
Contest
Brain Booster #8
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-17 15:18:12
Judged At
2025-02-17 15:18:12
Judged By
Score
0
Total Time
8ms
Peak Memory
832.0 KiB