Submission #8,698

2024-01-25 17:47:43

cpp17

Accepted 75/75

19ms

4160 KiB

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    vector<int> varosok(N, 0);
    for (int i = 0; i < N; i++) cin >> varosok[i];
    int jok = count(varosok.begin(), varosok.end(), 1);
    int sum = 0;
    for (int i = 2; i <= jok && i <= K; i++) {
        sum += jok - i + 1;
    }
    cout << sum;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	1812 KiB
		2	Accepted	0/0	3ms	2060 KiB
		3	Accepted	0/0	19ms	2848 KiB
		4	Accepted	5/5	3ms	2216 KiB
		5	Accepted	5/5	3ms	2432 KiB
		6	Accepted	5/5	3ms	2660 KiB
		7	Accepted	5/5	3ms	2724 KiB
		8	Accepted	5/5	2ms	2720 KiB
		9	Accepted	5/5	3ms	2724 KiB
		10	Accepted	5/5	3ms	2720 KiB
		11	Accepted	5/5	3ms	2860 KiB
		12	Accepted	5/5	3ms	3100 KiB
		13	Accepted	5/5	3ms	3280 KiB
		14	Accepted	5/5	19ms	4068 KiB
		15	Accepted	5/5	19ms	4068 KiB
		16	Accepted	5/5	19ms	4160 KiB
		17	Accepted	5/5	19ms	4068 KiB
		18	Accepted	5/5	19ms	4156 KiB