Submission #2858420
Source Code Expand
N, K = map(int, input().split()) arr_num, arr_times = [], [] for i in range(N) : a, b = map(int, input().split()) arr_num.append(a) arr_times.append(b) cur_idx = 0 for i in range(N) : if cur_idx <= K : cur_idx += arr_times[i] if cur_idx >= K : print(arr_num[i]) break
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | pupupupupunta |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 357 Byte |
Status | WA |
Exec Time | 331 ms |
Memory | 11064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
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 | 17 ms | 2940 KB |
sample_02.txt | AC | 17 ms | 2940 KB |
subtask_1_1.txt | WA | 18 ms | 3060 KB |
subtask_1_10.txt | WA | 330 ms | 11056 KB |
subtask_1_11.txt | WA | 310 ms | 10996 KB |
subtask_1_12.txt | WA | 303 ms | 11020 KB |
subtask_1_13.txt | WA | 320 ms | 11024 KB |
subtask_1_14.txt | WA | 306 ms | 11064 KB |
subtask_1_15.txt | AC | 331 ms | 10952 KB |
subtask_1_2.txt | WA | 28 ms | 3316 KB |
subtask_1_3.txt | WA | 116 ms | 5656 KB |
subtask_1_4.txt | WA | 212 ms | 8264 KB |
subtask_1_5.txt | WA | 293 ms | 10956 KB |
subtask_1_6.txt | WA | 17 ms | 2940 KB |
subtask_1_7.txt | WA | 18 ms | 3060 KB |
subtask_1_8.txt | WA | 36 ms | 3444 KB |
subtask_1_9.txt | WA | 136 ms | 6440 KB |