136682025-01-08 12:31:50kongopongVirágos rét (50 pont)cpp17Wrong answer 0/5021ms804 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector <int> v;
    v.resize(n);
    int db;
    for(int i=1; i<=n; i++)
    {
        cin >> v[i-1];
        if(v[i-1])
            db++;
    }
    int f=db+1-k;
    if(f<0)
        cout << 0;
    else
    {
        int ossz=0;
        for(int i=1; i<=f; i++)
            ossz=ossz+i;
        cout << ossz;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/04ms400 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/021ms564 KiB
4Wrong answer0/24ms500 KiB
5Wrong answer0/24ms316 KiB
6Wrong answer0/24ms396 KiB
7Wrong answer0/34ms316 KiB
8Wrong answer0/34ms316 KiB
9Wrong answer0/34ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/34ms404 KiB
12Wrong answer0/24ms316 KiB
13Wrong answer0/34ms500 KiB
14Wrong answer0/220ms580 KiB
15Wrong answer0/220ms564 KiB
16Wrong answer0/321ms564 KiB
17Wrong answer0/320ms784 KiB
18Wrong answer0/321ms804 KiB
19Wrong answer0/321ms736 KiB
20Wrong answer0/320ms804 KiB
21Wrong answer0/321ms564 KiB
22Wrong answer0/320ms564 KiB