Submission #3269912

Source Code Expand

N,K=map(int,input().split())
a=[]*N
b=0
for i in range(N):
    a.append(list(map(int,input().split())))
a.sort()
for i in range(N):
    b+=a[i][1]
    if b>=K:
      print(a[i][0])
      exit()

Submission Info

Submission Time
Task C - Big Array
User nattsu
Language Python (3.4.3)
Score 300
Code Size 203 Byte
Status AC
Exec Time 499 ms
Memory 27872 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 17 ms 3060 KB
sample_02.txt AC 17 ms 2940 KB
subtask_1_1.txt AC 19 ms 3060 KB
subtask_1_10.txt AC 492 ms 27784 KB
subtask_1_11.txt AC 481 ms 27872 KB
subtask_1_12.txt AC 449 ms 27872 KB
subtask_1_13.txt AC 434 ms 27872 KB
subtask_1_14.txt AC 388 ms 27764 KB
subtask_1_15.txt AC 370 ms 27300 KB
subtask_1_2.txt AC 33 ms 3940 KB
subtask_1_3.txt AC 156 ms 11052 KB
subtask_1_4.txt AC 313 ms 19308 KB
subtask_1_5.txt AC 499 ms 27784 KB
subtask_1_6.txt AC 17 ms 3060 KB
subtask_1_7.txt AC 19 ms 3060 KB
subtask_1_8.txt AC 41 ms 4572 KB
subtask_1_9.txt AC 193 ms 13556 KB