229932026-01-16 10:26:48SzBeatrixVirágos rét (50 pont)cpp14Time limit exceeded 36/50300ms1396 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k, db=0, db2=1;
    cin>>n>>k;
    vector<int> v;
    int t[n];
    for(int i=0; i<n; i++)
    {
        cin>>t[i];
        v.push_back(t[i]);
    }
    for(int i=n-1; i>=0; i--)
    {
        if(v[i]==1)
        {
            db++;
        }
        else
        {
            v.erase(v.begin()+i);
        }
    }
    if(db<k)
    {
        cout<<0;
    }
    else
    {
        for(int i=0; i<=db-k; i++)
        {
            while(v.size()>k)
            {
                v.pop_back();
                db2++;
            }
            v.resize(db-i, 1);
        }
        cout<<db2;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted0/0134ms1200 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms332 KiB
10Accepted2/21ms316 KiB
11Accepted3/32ms508 KiB
12Accepted2/21ms316 KiB
13Accepted3/31ms316 KiB
14Accepted2/217ms1200 KiB
15Time limit exceeded0/2300ms1200 KiB
16Time limit exceeded0/3300ms1216 KiB
17Accepted3/3190ms1396 KiB
18Time limit exceeded0/3280ms1200 KiB
19Accepted3/324ms1204 KiB
20Accepted3/3155ms1200 KiB
21Time limit exceeded0/3300ms1200 KiB
22Time limit exceeded0/3300ms1204 KiB