Submission #4678059
Source Code Expand
from operator import itemgetter n,h = map(int,input().split()) info = [list(map(int,input().split())) for i in range(n)] maxFuru = max(list(zip(*info))[0]) nageru = [] for i in range(n): if info[i][1] > maxFuru: nageru.append(info[i][1]) nageru = sorted(nageru) nokori = h ans = 0 while nokori>0: if nageru: nokori -= nageru[-1] del nageru[-1] ans += 1 else: ans += -(-nokori)//maxFuru nokori = 0 print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | neterukun |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 468 Byte |
Status | WA |
Exec Time | 442 ms |
Memory | 36084 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03, a04 |
All | a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | WA | 18 ms | 3064 KB |
a02 | AC | 18 ms | 3064 KB |
a03 | AC | 18 ms | 3064 KB |
a04 | AC | 19 ms | 3064 KB |
b05 | AC | 18 ms | 3064 KB |
b06 | AC | 379 ms | 36084 KB |
b07 | AC | 18 ms | 3064 KB |
b08 | WA | 385 ms | 36084 KB |
b09 | AC | 18 ms | 3064 KB |
b10 | WA | 18 ms | 3064 KB |
b11 | AC | 18 ms | 3064 KB |
b12 | AC | 18 ms | 3064 KB |
b13 | AC | 405 ms | 29684 KB |
b14 | AC | 382 ms | 29780 KB |
b15 | AC | 349 ms | 29684 KB |
b16 | AC | 357 ms | 29780 KB |
b17 | AC | 371 ms | 35672 KB |
b18 | WA | 384 ms | 33444 KB |
b19 | AC | 406 ms | 29684 KB |
b20 | AC | 388 ms | 29756 KB |
b21 | AC | 432 ms | 32736 KB |
b22 | AC | 442 ms | 36012 KB |
b23 | AC | 19 ms | 3064 KB |
b24 | WA | 27 ms | 3700 KB |