Submission #4018361

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i,m,n) for(int i = (m); i < (n); i++)
#define rrep(i,m,n) for(int i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]); if(i!=n-1) cout << " ";} cout << endl;
#define printp(x,n) for(int i = 0; i < n; i++){ cout << "(" << x[i].first << ", " << x[i].second << ") "; } cout << endl;
#define INF (1e18)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
typedef pair<ll, ll> lpair;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,K;
    cin >> N >> K;
    ll t[100010];
    rep(i,0,N){
        cin >> t[i];
    }
    ll val = t[0] + t[1] + t[2];
    rep(i,3,N){
        if(val < K){
            print(i);
            return 0;
        }else{
            val -= t[i-3];
            val += t[i];
        }
    }
    if(val < K){
        print(N);
    }else{
        print(-1);
    }
}

Submission Info

Judge Result