219322026-01-14 10:39:30BravoLeggyorsabb pénzkeresés (50)cpp17Time limit exceeded 44/50221ms1268 KiB
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;

int main()
{
    //ifstream f("sor.txt");
    int n,k;
    cin >> n >> k;
    int a[n];
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    int penz[n];
    for(int i=0;i<n;i++){
        int c=0,z=0;
        int o=i;
        while(c<k){
            c+=a[o];
            o++;
            z++;
        }
        if(c>=k && o<=n-1){
            penz[i]=z;
        }
        else{
            penz[i]=n;
        }
    }
    int c=INT_MAX;
    for(int i=0;i<n;i++){
        if(penz[i]<c){
            c=penz[i];
        }
    }
    cout << c;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base44/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0210ms1076 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/27ms508 KiB
7Accepted2/216ms316 KiB
8Accepted2/219ms448 KiB
9Accepted2/26ms316 KiB
10Accepted2/217ms456 KiB
11Accepted2/232ms1076 KiB
12Time limit exceeded0/2221ms988 KiB
13Accepted2/2157ms1076 KiB
14Accepted2/265ms1268 KiB
15Accepted2/2155ms1100 KiB
16Accepted2/263ms1076 KiB
17Accepted2/259ms1076 KiB
18Accepted2/281ms1112 KiB
19Accepted2/2188ms1076 KiB
20Accepted2/2130ms1076 KiB
21Accepted2/286ms1076 KiB
22Accepted2/2114ms1052 KiB
23Time limit exceeded0/2214ms1076 KiB
24Wrong answer0/2111ms1076 KiB
25Accepted2/2137ms1020 KiB
26Accepted2/283ms1076 KiB
27Accepted2/282ms1076 KiB