Submission #1605500

Source Code Expand

N, K = [int(i) for i in input().split()]
ans = []
A = [[]*2]*N
num = 0
for i in range(N):
    A[i] = [int(i) for i in input().split()]
A.sort()
i = 0
while num < K:
    num += A[i][1]
    i += 1

print(A[i-1][0])

Submission Info

Submission Time
Task C - Big Array
User satori2573
Language Python (3.4.3)
Score 300
Code Size 224 Byte
Status AC
Exec Time 441 ms
Memory 21652 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 17
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 16 ms 3060 KB
sample_02.txt AC 17 ms 2940 KB
subtask_1_1.txt AC 18 ms 3064 KB
subtask_1_10.txt AC 441 ms 21644 KB
subtask_1_11.txt AC 427 ms 21600 KB
subtask_1_12.txt AC 394 ms 21600 KB
subtask_1_13.txt AC 408 ms 21600 KB
subtask_1_14.txt AC 354 ms 21492 KB
subtask_1_15.txt AC 342 ms 21156 KB
subtask_1_2.txt AC 32 ms 3684 KB
subtask_1_3.txt AC 142 ms 9012 KB
subtask_1_4.txt AC 274 ms 15200 KB
subtask_1_5.txt AC 424 ms 21652 KB
subtask_1_6.txt AC 17 ms 2940 KB
subtask_1_7.txt AC 18 ms 3064 KB
subtask_1_8.txt AC 39 ms 4188 KB
subtask_1_9.txt AC 176 ms 10888 KB