Submission #3390208

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;

int main(int argc, char const* argv[])
{
  int n, k;
  cin >> n >> k;
  vector<int> t;
  t.resize(n);
  for(int i = 0; i < n; i++){
    int a;
    cin >> a;
    t[i] = a;
  }
  for(int i = 2; i < n; i++){
    int tmp = t[i] + t[i - 1] + t[i - 2];
    if(tmp < k){
      cout << i + 1 << endl;
      return 0;
    }
  }
  cout << -1 << endl;
	return 0;
}

Submission Info

Judge Result