Submission #14,349

2025-01-10 17:05:57

cpp17

Wrong answer 4/50

18ms

508 KiB

#include <list>
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>

using namespace std;

int main() {

    int n, k;
    cin >> n >> k;

    int true_fields = 0;
    for (int i = 0; i < n; i++) {
        bool field;
        cin >> field;

        if (field) true_fields++;
    }

    cout << max((true_fields - k + 1) * 2, 0);

    return 0;
}

// m - k, m - k - 1, 1

	Sum	Test	Verdict		Time	Memory
base	4/50
		1	Accepted	0/0	1ms	500 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Wrong answer	0/0	18ms	404 KiB
		4	Wrong answer	0/2	1ms	508 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Wrong answer	0/3	1ms	392 KiB
		8	Wrong answer	0/3	1ms	316 KiB
		9	Wrong answer	0/3	1ms	316 KiB
		10	Wrong answer	0/2	1ms	316 KiB
		11	Wrong answer	0/3	1ms	316 KiB
		12	Wrong answer	0/2	1ms	316 KiB
		13	Wrong answer	0/3	1ms	316 KiB
		14	Wrong answer	0/2	17ms	400 KiB
		15	Wrong answer	0/2	17ms	404 KiB
		16	Wrong answer	0/3	17ms	396 KiB
		17	Wrong answer	0/3	17ms	400 KiB
		18	Wrong answer	0/3	18ms	400 KiB
		19	Wrong answer	0/3	17ms	392 KiB
		20	Wrong answer	0/3	17ms	400 KiB
		21	Wrong answer	0/3	18ms	404 KiB
		22	Wrong answer	0/3	17ms	332 KiB