Submission #3593067

Source Code Expand

n,k = map(int,input().split())
num_list = []
for _ in range(n):
    num_list .append(list(map(int,input().split())))
num_list.sort()
cnt = 0
ans = 0

for num in num_list:
    if cnt < k:
        cnt += num[1]
        ans  = num[0]
    else:
        break
print(ans)

Submission Info

Submission Time
Task C - Big Array
User stoevalue
Language Python (3.4.3)
Score 300
Code Size 279 Byte
Status AC
Exec Time 578 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 18 ms 2940 KB
sample_02.txt AC 18 ms 2940 KB
subtask_1_1.txt AC 19 ms 3060 KB
subtask_1_10.txt AC 578 ms 27792 KB
subtask_1_11.txt AC 549 ms 27872 KB
subtask_1_12.txt AC 503 ms 27872 KB
subtask_1_13.txt AC 473 ms 27872 KB
subtask_1_14.txt AC 413 ms 27764 KB
subtask_1_15.txt AC 365 ms 27300 KB
subtask_1_2.txt AC 33 ms 3940 KB
subtask_1_3.txt AC 163 ms 11052 KB
subtask_1_4.txt AC 325 ms 19308 KB
subtask_1_5.txt AC 516 ms 27800 KB
subtask_1_6.txt AC 17 ms 2940 KB
subtask_1_7.txt AC 19 ms 3060 KB
subtask_1_8.txt AC 42 ms 4572 KB
subtask_1_9.txt AC 208 ms 13560 KB