210682026-01-12 10:54:40KosAKosFasor (40)cpp17Wrong answer 0/4071ms1200 KiB
#include <iostream>

using namespace std;

int n,k,teto;
int fa[1000000];
int temp=1,temp2;


int main()
{
    cin >> n;
    cin >> k;
    for (int i=0;i<n;i++)
    {
        cin >> fa[i];
        if (teto < fa[i] && fa[i] <= k) teto = fa[i];
    }

    while(temp != 0)
    {
        temp = 0;
        for (int i=0;i<n;i++)
        {
            if (teto< fa[i] && fa[i] <= teto+k)
            {
                teto = fa[i];
                temp++;
                temp2++;
            }
        }
    }
    cout << temp2;


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/02ms316 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/22ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/22ms560 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms420 KiB
11Wrong answer0/24ms412 KiB
12Wrong answer0/23ms500 KiB
13Wrong answer0/235ms608 KiB
14Wrong answer0/232ms776 KiB
15Wrong answer0/254ms1200 KiB
16Wrong answer0/264ms1044 KiB
17Wrong answer0/271ms1160 KiB
18Wrong answer0/271ms1116 KiB
19Wrong answer0/270ms1028 KiB
20Wrong answer0/220ms564 KiB
21Wrong answer0/256ms1020 KiB
22Wrong answer0/271ms1076 KiB