Submission #2855219
Source Code Expand
import math n, h = map(int, input().split()) alst = [] blst = [] for _ in range(n): a, b = map(int, input().split()) alst.append(a) blst.append(b) ma = max(alst) blst.sort(reverse=True) ans = 0 for b in blst: if b < ma: break if h <= 0: break h -= b ans += 1 if h > 0: ans += math.ceil(h / ma) print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | orca |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 356 Byte |
Status | AC |
Exec Time | 352 ms |
Memory | 11316 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | AC | 17 ms | 3064 KB |
a02 | AC | 18 ms | 3060 KB |
a03 | AC | 18 ms | 3064 KB |
a04 | AC | 18 ms | 3060 KB |
b05 | AC | 17 ms | 3060 KB |
b06 | AC | 306 ms | 11036 KB |
b07 | AC | 17 ms | 3060 KB |
b08 | AC | 291 ms | 10964 KB |
b09 | AC | 17 ms | 3060 KB |
b10 | AC | 17 ms | 3064 KB |
b11 | AC | 17 ms | 3060 KB |
b12 | AC | 18 ms | 3064 KB |
b13 | AC | 299 ms | 4760 KB |
b14 | AC | 287 ms | 4752 KB |
b15 | AC | 280 ms | 4748 KB |
b16 | AC | 300 ms | 4760 KB |
b17 | AC | 337 ms | 10964 KB |
b18 | AC | 314 ms | 8728 KB |
b19 | AC | 334 ms | 5076 KB |
b20 | AC | 310 ms | 5096 KB |
b21 | AC | 352 ms | 8004 KB |
b22 | AC | 345 ms | 11316 KB |
b23 | AC | 18 ms | 3064 KB |
b24 | AC | 24 ms | 3188 KB |