136842025-01-08 12:38:14kongopongVirágos rét (50 pont)cpp17Accepted 50/5018ms612 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector <int> v;
    v.resize(n);
    int db = 0;
    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
    {
        long ossz=0;
        for(int i=1; i<=f; i++)
            ossz=ossz+i;
        cout << ossz;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/01ms316 KiB
3Accepted0/018ms564 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms500 KiB
10Accepted2/21ms316 KiB
11Accepted3/31ms316 KiB
12Accepted2/21ms316 KiB
13Accepted3/31ms500 KiB
14Accepted2/217ms564 KiB
15Accepted2/218ms564 KiB
16Accepted3/318ms612 KiB
17Accepted3/317ms564 KiB
18Accepted3/318ms564 KiB
19Accepted3/318ms564 KiB
20Accepted3/318ms564 KiB
21Accepted3/318ms564 KiB
22Accepted3/318ms564 KiB