171602025-05-26 21:34:50MolnárÚthasználati díj (75 pont)cpp17Wrong answer 5/7517ms512 KiB
#include <iostream>
using namespace std;

int main()
{
    int n, k, x;
    cin >> n >> k;
    int j = 0;

    for (int i = 0; i < n; i++)
    {
        cin >> x;

        if (x == 1)
        {
            j++;
        }
    }

    int ossz = 0;

    // for (int i = 0; i < j; i++)
    // {
    //     // ossz += min(k - 1, j - i - 1);
    //     if (k - 1 < j - i - 1)
    //         ossz = ossz + k - 1;
    //     else
    //         ossz = ossz + j - i - 1;
    // }

    if (k <= j) {
        ossz = (j - k) * k + k * (k - 1) / 2;
    }

    cout << ossz;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base5/75
1Wrong answer0/01ms512 KiB
2Accepted0/01ms316 KiB
3Wrong answer0/017ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/51ms316 KiB
6Wrong answer0/51ms316 KiB
7Accepted5/51ms316 KiB
8Wrong answer0/51ms316 KiB
9Wrong answer0/51ms316 KiB
10Wrong answer0/52ms316 KiB
11Wrong answer0/51ms316 KiB
12Wrong answer0/51ms316 KiB
13Wrong answer0/51ms316 KiB
14Wrong answer0/517ms396 KiB
15Wrong answer0/517ms404 KiB
16Wrong answer0/517ms396 KiB
17Wrong answer0/517ms396 KiB
18Wrong answer0/517ms508 KiB