Submission #11353560

Source Code Expand

from operator import itemgetter
n,k = (map(int,input().split()))
a = sorted([list(map(int,input().split())) for i in range(n)])
count = 0
for i in range(len(a)):
         count += a[i][1]
         if count >= k:
                  print(a[i][0])
                  exit()

Submission Info

Submission Time
Task C - Big Array
User umasi
Language Python (3.4.3)
Score 300
Code Size 290 Byte
Status AC
Exec Time 500 ms
Memory 28668 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 3060 KB
subtask_1_1.txt AC 19 ms 3060 KB
subtask_1_10.txt AC 500 ms 28668 KB
subtask_1_11.txt AC 483 ms 28592 KB
subtask_1_12.txt AC 447 ms 28592 KB
subtask_1_13.txt AC 465 ms 28592 KB
subtask_1_14.txt AC 384 ms 28612 KB
subtask_1_15.txt AC 351 ms 28148 KB
subtask_1_2.txt AC 34 ms 4084 KB
subtask_1_3.txt AC 152 ms 11324 KB
subtask_1_4.txt AC 309 ms 19828 KB
subtask_1_5.txt AC 482 ms 28652 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 4596 KB
subtask_1_9.txt AC 192 ms 13900 KB