207692026-01-08 19:45:56KoszorusBlankaVirágos rét (50 pont)cpp17Wrong answer 42/5019ms808 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    int db1 = 0;
    vector <int> R(N+1);
    for (int i = 1; i <= N; i++) {
        cin >> R[i];
        if (R[i]==1) { db1++; }
    }

    if (db1 < K) { cout << 0; }else if (db1 == K) { cout << 1; }else {
        int ossz = 0;
        for (int i = 1; i <= N; i++) {
            if (R[i]==1) {
                if (db1 >= K) ossz += db1-K+1;
                db1--;
            }
        }
        cout << ossz;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base42/50
1Accepted0/01ms316 KiB
2Accepted0/02ms316 KiB
3Accepted0/019ms756 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms508 KiB
9Accepted3/31ms316 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms316 KiB
13Accepted3/31ms316 KiB
14Accepted2/217ms780 KiB
15Wrong answer0/217ms564 KiB
16Accepted3/319ms564 KiB
17Accepted3/317ms788 KiB
18Wrong answer0/319ms564 KiB
19Accepted3/318ms564 KiB
20Accepted3/318ms808 KiB
21Accepted3/319ms804 KiB
22Wrong answer0/318ms564 KiB