Submission #6977868


Source Code Expand

import math
N, H = map(int, input().split())
a = [0] * N
b = [0] * N
for i in range(N):
    a[i], b[i] = map(int, input().split())

x = max(a)
b_list= []
for i in range(N):
    if b[i] > x :
        b_list.append(b[i])

y = sum(b_list)

ans = math.ceil((H-y)/x) + len(b_list)
#print(H, y, x, len(b))
#print(b_list)

print(ans)

Submission Info

Submission Time
Task D - Katana Thrower
User shoheihoh
Language Python (3.4.3)
Score 0
Code Size 345 Byte
Status WA
Exec Time 301 ms
Memory 11696 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 21
WA × 3
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 3064 KB
a03 AC 17 ms 3064 KB
a04 AC 17 ms 3064 KB
b05 AC 17 ms 3064 KB
b06 AC 293 ms 10868 KB
b07 AC 17 ms 3064 KB
b08 AC 294 ms 10868 KB
b09 AC 17 ms 3060 KB
b10 AC 17 ms 3064 KB
b11 AC 17 ms 3060 KB
b12 AC 17 ms 3064 KB
b13 AC 288 ms 5552 KB
b14 WA 292 ms 5552 KB
b15 AC 273 ms 4596 KB
b16 AC 273 ms 4596 KB
b17 AC 281 ms 10484 KB
b18 AC 284 ms 8288 KB
b19 AC 295 ms 5552 KB
b20 WA 289 ms 5300 KB
b21 WA 293 ms 8372 KB
b22 AC 301 ms 11696 KB
b23 AC 17 ms 3064 KB
b24 AC 23 ms 3188 KB