Submission #3271757


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)

ll mod = 1e09 + 7;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n, k;
  cin >> n >> k;
  ll a[n], b[n];
  ll s[n + 1];
  s[0] = 0;
  REP(i, n){
    cin >> a[i] >> b[i];
    s[i + 1] = s[i] + b[i];
  }
  REP(i, n){
    if(k <= s[i + 1]){
      cout << a[i];
      return 0;
    }
  }
}

Submission Info

Submission Time
Task C - Big Array
User harsaka
Language C++14 (GCC 5.4.1)
Score 0
Code Size 702 Byte
Status WA
Exec Time 18 ms
Memory 2560 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 3
WA × 14
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_1.txt WA 1 ms 256 KB
subtask_1_10.txt WA 17 ms 2560 KB
subtask_1_11.txt WA 17 ms 2560 KB
subtask_1_12.txt WA 17 ms 2560 KB
subtask_1_13.txt WA 16 ms 2560 KB
subtask_1_14.txt WA 17 ms 2560 KB
subtask_1_15.txt AC 18 ms 2560 KB
subtask_1_2.txt WA 2 ms 384 KB
subtask_1_3.txt WA 6 ms 1024 KB
subtask_1_4.txt WA 11 ms 1792 KB
subtask_1_5.txt WA 17 ms 2560 KB
subtask_1_6.txt WA 1 ms 256 KB
subtask_1_7.txt WA 1 ms 256 KB
subtask_1_8.txt WA 2 ms 384 KB
subtask_1_9.txt WA 8 ms 1280 KB