136482025-01-08 12:07:48feheristvanVirágos rét (50 pont)cpp17Wrong answer 42/5017ms544 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    int x, egyes = 0;
    for(int i = 0; i < n; i ++){
        cin >> x;
        if(x)
            egyes ++;
    }
    if(egyes < k)
        cout << 0;
    else{
        int ossz = 0, most = 0;
        while(egyes - k - most + 1 > 0){
            ossz += egyes - k - most + 1;
            most ++;
        }
        cout << ossz;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base42/50
1Accepted0/01ms500 KiB
2Accepted0/01ms316 KiB
3Accepted0/017ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms384 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms500 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms544 KiB
13Accepted3/31ms316 KiB
14Accepted2/216ms396 KiB
15Wrong answer0/217ms400 KiB
16Accepted3/317ms400 KiB
17Accepted3/317ms404 KiB
18Wrong answer0/317ms404 KiB
19Accepted3/317ms404 KiB
20Accepted3/317ms412 KiB
21Accepted3/317ms508 KiB
22Wrong answer0/317ms396 KiB