Submission #9,936

2024-03-19 11:00:02

cpp17

Accepted 50/50

20ms

5424 KiB

#include <iostream>
#include <queue>
#define ll long long

using namespace std;

int main()
{
    ll n, k, osz = 0, db = 0;
    bool elso;
    cin >> n >> k;
    vector <ll> x(n + 1);
    for (ll i = 1; i <= n; ++i)
    {
        cin >> x[i];
        if (x[i] == 1)
        {
            ++db;
            x[i] = db;
            if (db >= k)
                osz += x[i] - k + 1;
        }
    }
    cout << osz;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1808 KiB
		2	Accepted	0/0	3ms	2064 KiB
		3	Accepted	0/0	20ms	3652 KiB
		4	Accepted	2/2	3ms	2324 KiB
		5	Accepted	2/2	3ms	2424 KiB
		6	Accepted	2/2	3ms	2516 KiB
		7	Accepted	3/3	3ms	2644 KiB
		8	Accepted	3/3	3ms	2852 KiB
		9	Accepted	3/3	3ms	3064 KiB
		10	Accepted	2/2	3ms	3180 KiB
		11	Accepted	3/3	3ms	3284 KiB
		12	Accepted	2/2	3ms	3392 KiB
		13	Accepted	3/3	3ms	3528 KiB
		14	Accepted	2/2	18ms	4844 KiB
		15	Accepted	2/2	18ms	4816 KiB
		16	Accepted	3/3	20ms	4948 KiB
		17	Accepted	3/3	19ms	4904 KiB
		18	Accepted	3/3	20ms	5172 KiB
		19	Accepted	3/3	19ms	5272 KiB
		20	Accepted	3/3	20ms	5356 KiB
		21	Accepted	3/3	20ms	5336 KiB
		22	Accepted	3/3	19ms	5424 KiB