Submission #3979400

---

Source Code Expand

// バケット法
#include <iostream>
using namespace std;

int main() {
    int N,K;
    int t=-1;
    int d[100010] = {};
    cin >> N>>K;
    int sum=0;
    for (int i = 0; i < N; ++i) cin >> d[i];
    for (int i = 2; i < N; i++) {
        //cout << i<<"\n" << " ";
        if (d[i-1] + d[i-2]+d[i]<K){
            t = i+1;
            break;
        }
    }
    cout << t << endl;
}

Submission Info

Judge Result