Submission #74962490

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
#define T int t;cin>>t;while(t--)

const int N=2e5+5;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f3f3f3f3f;

void solve(){
    int n,m;
    cin>>n>>m;
    vector<int> a(n);
    for(int i=1;i<n;i++){
        cin>>a[i];
    }
    int cnt=1;
    for(int i=1;i<n;i++){
        if(m==0&&a[i]==1) break;
        if(a[i]==0) cnt++;
        else{
            if(m>0){
                cnt++;
                m--;
            }
        }
    }
    cout<<cnt<<endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //T
    solve();
    return 0;
}

Submission Info

Judge Result