Submission #4666780
Source Code Expand
N, H = map(int, input().split()) A = [] B = [] for i in range(N): a, b = map(int, input().split()) A.append(a) B.append(b) B.sort(reverse = True) maxA = max(A) cnt = 0 for b in B: if b > maxA and H > 0: H -= b cnt += 1 cnt += - (- H // maxA) print(cnt)
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | Asymmetry |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 313 Byte |
Status | WA |
Exec Time | 355 ms |
Memory | 11348 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 | AC | 17 ms | 3064 KB |
a02 | AC | 17 ms | 3060 KB |
a03 | AC | 17 ms | 3060 KB |
a04 | AC | 17 ms | 3060 KB |
b05 | AC | 17 ms | 3064 KB |
b06 | AC | 299 ms | 10940 KB |
b07 | AC | 17 ms | 3060 KB |
b08 | AC | 313 ms | 10940 KB |
b09 | AC | 17 ms | 3060 KB |
b10 | AC | 17 ms | 3064 KB |
b11 | AC | 17 ms | 3060 KB |
b12 | AC | 17 ms | 2940 KB |
b13 | AC | 309 ms | 4724 KB |
b14 | AC | 300 ms | 4648 KB |
b15 | AC | 290 ms | 4644 KB |
b16 | AC | 286 ms | 4716 KB |
b17 | AC | 340 ms | 10968 KB |
b18 | AC | 326 ms | 8744 KB |
b19 | AC | 319 ms | 5104 KB |
b20 | AC | 313 ms | 5024 KB |
b21 | WA | 342 ms | 7996 KB |
b22 | AC | 355 ms | 11348 KB |
b23 | AC | 17 ms | 3064 KB |
b24 | AC | 24 ms | 3188 KB |