Submission #3868493

---

Source Code Expand

#include<iostream>
using namespace std;

const int MAX_N = 100001;

int t[MAX_N];

int main() {
    int N, K;
    cin >> N >> K;
    for (int i = 1; i <= N; i++) {
        cin >> t[i];
        if (i != 1) t[i] += t[i - 1];
    }
    for (int i = 3; i <= N; i++) {
        if (t[i] - t[i - 3] < K) {
            cout << i << endl;
            return 0;
        }
    }
    cout << -1 << endl;
    return 0;
}

Submission Info

Judge Result