Submission #2858437
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) # do sort s_num, s_times = [], [] s_idx = sorted(range(N), key = lambda k : arr_num[k]) # propagate arr for i in s_idx : s_num.append(arr_num[i]) s_times.append(arr_times[i]) cur_idx = 0 for i in range(N) : if cur_idx <= K : cur_idx += s_times[i] if cur_idx >= K : print(s_num[i]) break
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | pupupupupunta |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 549 Byte |
Status | AC |
Exec Time | 414 ms |
Memory | 17768 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 3064 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
subtask_1_1.txt | AC | 19 ms | 3064 KB |
subtask_1_10.txt | AC | 414 ms | 17532 KB |
subtask_1_11.txt | AC | 392 ms | 17768 KB |
subtask_1_12.txt | AC | 387 ms | 17652 KB |
subtask_1_13.txt | AC | 402 ms | 16452 KB |
subtask_1_14.txt | AC | 356 ms | 17748 KB |
subtask_1_15.txt | AC | 349 ms | 17636 KB |
subtask_1_2.txt | AC | 31 ms | 3572 KB |
subtask_1_3.txt | AC | 140 ms | 7880 KB |
subtask_1_4.txt | AC | 258 ms | 12512 KB |
subtask_1_5.txt | AC | 401 ms | 17760 KB |
subtask_1_6.txt | AC | 17 ms | 3064 KB |
subtask_1_7.txt | AC | 19 ms | 3064 KB |
subtask_1_8.txt | AC | 39 ms | 3828 KB |
subtask_1_9.txt | AC | 165 ms | 9340 KB |