Submission #1387475
Source Code Expand
# -*- coding: utf-8 -*- import math import sys import itertools import numpy as np n, k = map(int, input().split()) memo = np.zeros(100010, dtype=np.int) for i in range(n): a, b = map(int, input().split()) memo[a] += b s = 0 for i in range(len(memo)): s += memo[i] if k <= s: print(i) exit()
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | hamko |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 344 Byte |
Status | AC |
Exec Time | 806 ms |
Memory | 20908 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 397 ms | 20908 KB |
sample_02.txt | AC | 147 ms | 14420 KB |
subtask_1_1.txt | AC | 228 ms | 13140 KB |
subtask_1_10.txt | AC | 761 ms | 13140 KB |
subtask_1_11.txt | AC | 755 ms | 12500 KB |
subtask_1_12.txt | AC | 664 ms | 12388 KB |
subtask_1_13.txt | AC | 653 ms | 12388 KB |
subtask_1_14.txt | AC | 667 ms | 12388 KB |
subtask_1_15.txt | AC | 806 ms | 12388 KB |
subtask_1_2.txt | AC | 189 ms | 13140 KB |
subtask_1_3.txt | AC | 392 ms | 13140 KB |
subtask_1_4.txt | AC | 542 ms | 15188 KB |
subtask_1_5.txt | AC | 658 ms | 13136 KB |
subtask_1_6.txt | AC | 249 ms | 12500 KB |
subtask_1_7.txt | AC | 151 ms | 13140 KB |
subtask_1_8.txt | AC | 179 ms | 13136 KB |
subtask_1_9.txt | AC | 369 ms | 13140 KB |