Submission #3589907


Source Code Expand

N,K=map(int,input().split())
List_First=[[int(i) for i in input().split()] for i in range(N)]
List_a=[i[0] for i in List_First]
List_b=[i[1] for i in List_First]
List_n=[i for i in range(N)]
new_List_n=sorted(List_n,key=lambda x:List_a[x])
new_List_a=[List_a[i] for i in new_List_n]
new_List_b=[List_b[i] for i in new_List_n]
S=0
m=-1
while S<K:
  m+=1
  S+=new_List_b[m]
print(new_List_a[m])
  
  

Submission Info

Submission Time
Task C - Big Array
User Chanyuh
Language Python (3.4.3)
Score 300
Code Size 413 Byte
Status AC
Exec Time 487 ms
Memory 29776 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 18 ms 3064 KB
sample_02.txt AC 18 ms 3064 KB
subtask_1_1.txt AC 20 ms 3064 KB
subtask_1_10.txt AC 487 ms 29048 KB
subtask_1_11.txt AC 466 ms 29108 KB
subtask_1_12.txt AC 449 ms 29712 KB
subtask_1_13.txt AC 457 ms 29084 KB
subtask_1_14.txt AC 398 ms 29028 KB
subtask_1_15.txt AC 389 ms 29776 KB
subtask_1_2.txt AC 33 ms 4084 KB
subtask_1_3.txt AC 145 ms 11560 KB
subtask_1_4.txt AC 288 ms 20184 KB
subtask_1_5.txt AC 460 ms 29156 KB
subtask_1_6.txt AC 18 ms 3064 KB
subtask_1_7.txt AC 19 ms 3064 KB
subtask_1_8.txt AC 40 ms 4596 KB
subtask_1_9.txt AC 186 ms 14064 KB