input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import fractions
def main():
n = int(eval(input()))
if n%2 == 0:
print(n)
else:
print((2*n))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
if n%2 == 0:
print(n)
else:
print((2*n))
if __name__ == '__main__':
main() | p03307 |
def solve(h, w):
if h % 3 == 0 or w % 3 == 0:
return 0
if w < h:
h, w = w, h
if h == 1:
return 1
min_diff = h * w
vals = [0, 0, 0]
for i in range(1, w // 2 + 1):
vals[0] = i * h
if h % 2 == 0:
vals[1] = (w - i) * (h // 2)
vals[2] = vals[1]
else:
vals[1] = (w - i) * (h // 2 + 1)
vals[2] = (w - i) * (h // 2)
diff = max(vals) - min(vals)
if diff < min_diff:
min_diff = diff
if (w - i) % 2 == 0:
vals[1] = h * ((w - i) // 2)
vals[2] = vals[1]
else:
vals[1] = h * ((w - i) // 2 + 1)
vals[2] = h * ((w - i) // 2)
diff = max(vals) - min(vals)
if diff < min_diff:
min_diff = diff
h, w = w, h
for i in range(1, w // 2 + 1):
vals[0] = i * h
if h % 2 == 0:
vals[1] = (w - i) * (h // 2)
vals[2] = vals[1]
else:
vals[1] = (w - i) * (h // 2 + 1)
vals[2] = (w - i) * (h // 2)
diff = max(vals) - min(vals)
if diff < min_diff:
min_diff = diff
if (w - i) % 2 == 0:
vals[1] = h * ((w - i) // 2)
vals[2] = vals[1]
else:
vals[1] = h * ((w - i) // 2 + 1)
vals[2] = h * ((w - i) // 2)
diff = max(vals) - min(vals)
if diff < min_diff:
min_diff = diff
return min_diff
_h, _w = list(map(int, input().split()))
print((solve(_h, _w)))
| def solve(h, w):
if h % 3 == 0 or w % 3 == 0:
return 0
if h == 1 or w == 1:
return 1
def f(a, b):
vals = [0, 0, 0]
min_diff = h * w
for i in range(1, a // 2 + 1):
vals[0] = i * b
vals[1] = (a - i) * (b // 2 + b % 2)
vals[2] = (a - i) * (b // 2)
diff = max(vals) - min(vals)
if diff < min_diff:
min_diff = diff
vals[1] = b * ((a - i) // 2 + (a - i) % 2)
vals[2] = b * ((a - i) // 2)
diff = max(vals) - min(vals)
if diff < min_diff:
min_diff = diff
return min_diff
return min(f(h, w), f(w, h))
_h, _w = list(map(int, input().split()))
print((solve(_h, _w)))
| p03715 |
h, w = list(map(int, input().split()))
if h%3 == 0 or w%3 == 0:
print((0))
exit()
#print(h, w)
min_ = float('inf')
for i in range(1, h):
s1 = w*i
s2 = (h-i)*(w//2)
s3 = (h-i)*(w-w//2)
d = max([s1, s2, s3]) - min([s1, s2, s3])
#print(i, s1, s2, s3, d)
min_ = min(min_, d)
s2 = ((h-i)//2)*w
s3 = ((h-i) - (h-i)//2)*w
d = max([s1, s2, s3]) - min([s1, s2, s3])
#print(i, s1, s2, s3, d)
min_ = min(min_, d)
#print('-')
for i in range(1, w):
s1 = h*i
s2 = (w-i)*(h//2)
s3 = (w-i)*(h-h//2)
d = max([s1, s2, s3]) - min([s1, s2, s3])
#print(i, s1, s2, s3, d)
min_ = min(min_, d)
s2 = ((w-i)//2)*h
s3 = ((w-i) - (w-i)//2)*h
d = max([s1, s2, s3]) - min([s1, s2, s3])
#print(i, s1, s2, s3, d)
min_ = min(min_, d)
print(min_) | h, w = list(map(int, input().split()))
ans = 10**18
for i in range(1, h):
S1 = i*w
# tate
if h-i >= 2:
p = (h-i)//2
q = h-(h-i)//2-i
S2 = p*w
S3 = q*w
M = max([S1, S2, S3])
m = min([S1, S2, S3])
ans = min(ans, M-m)
#if i == 1:
#print(S1, S2, S3)
# yoko
S2 = (h-i)*(w//2)
S3 = (h-i)*(w-w//2)
M = max([S1, S2, S3])
m = min([S1, S2, S3])
ans = min(ans, M-m)
for i in range(1, w):
S1 = h*i
# yoko
if w-i >= 2:
p = (w-i)//2
q = w-(w-i)//2-i
S2 = h*p
S3 = h*q
M = max([S1, S2, S3])
m = min([S1, S2, S3])
ans = min(ans, M-m)
# tate
S2 = (h//2)*(w-i)
S3 = (h-h//2)*(w-i)
M = max([S1, S2, S3])
m = min([S1, S2, S3])
ans = min(ans, M-m)
print(ans)
| p03715 |
import sys
inf = 1<<60
ans = inf
def solve():
H, W = list(map(int, input().split()))
calc(H, W)
calc(W, H)
print(ans)
def calc(H, W):
global ans
for a in range(1, W):
s0 = a * H
s1 = H * ((W - a + 1) // 2)
s2 = H * ((W - a) // 2)
ans = min(ans, max(s0, s1, s2) - min(s0, s1, s2))
s1 = (W - a) * ((H + 1) // 2)
s2 = (W - a) * (H // 2)
ans = min(ans, max(s0, s1, s2) - min(s0, s1, s2))
if __name__ == '__main__':
solve() | import sys
inf = 1<<60
ans = inf
def solve():
H, W = list(map(int, input().split()))
calc(H, W)
calc(W, H)
print(ans)
def calc(H, W):
global ans
x = W // 3
s0 = x * H
s1 = H * ((W - x + 1) // 2)
s2 = H * ((W - x) // 2)
ans = min(ans, max(s0, s1, s2) - min(s0, s1, s2))
s1 = (W - x) * ((H + 1) // 2)
s2 = (W - x) * (H // 2)
ans = min(ans, max(s0, s1, s2) - min(s0, s1, s2))
x = (W + 2) // 3
s0 = x * H
s1 = H * ((W - x + 1) // 2)
s2 = H * ((W - x) // 2)
ans = min(ans, max(s0, s1, s2) - min(s0, s1, s2))
s1 = (W - x) * ((H + 1) // 2)
s2 = (W - x) * (H // 2)
ans = min(ans, max(s0, s1, s2) - min(s0, s1, s2))
if __name__ == '__main__':
solve() | p03715 |
H, W = list(map(int, input().split()))
if H % 3 == 0 or W % 3 == 0:
print((0))
exit()
ans = min(H, W)
for w1 in [W // 3, W // 3 + 1]:
w23 = W - w1
for h2 in [H // 2, H // 2 + 1]:
h3 = H - h2
S1 = w1 * H
S2 = h2 * w23
S3 = h3 * w23
ans = min(ans, max(S1, S2, S3) - min(S1, S2, S3))
for h1 in [H // 3, H // 3 + 1]:
h23 = H - h1
for w2 in [W // 2, W // 2 + 1]:
w3 = W - w2
S1 = h1 * W
S2 = w2 * h23
S3 = w3 * h23
ans = min(ans, max(S1, S2, S3) - min(S1, S2, S3))
print(ans) | H, W = list(map(int, input().split()))
if H % 3 == 0 or W % 3 == 0:
print((0))
exit()
ans = min(H, W)
for A, B in ((H, W), (W, H)):
for a in (A // 3, A // 3 + 1):
for b in (B // 2, B // 2 + 1):
X = a * B
Y = (A - a) * b
Z = (A - a) * (B - b)
ans = min(ans, max(X, Y, Z) - min(X, Y, Z))
print(ans)
| p03715 |
from math import floor, ceil
h, w = list(map(int, input().split(' ')))
result = []
if h%3 == 0 or w%3 == 0:
print((0))
elif h<3 or w<3:
if h<3 and w>=3:
for i in range(1, w-1):
x = i*h
y = (w-i)*floor(h/2)
z = (w-i)*ceil(h/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((w-i)/2)*h
z = ceil((w-i)/2)*h
result.append(max(x,y,z)-min(x,y,z))
print((min(result)))
elif h>=3 and w<3:
for i in range(1, h-1):
x = i*w
y = (h-i)*floor(w/2)
z = (h-i)*ceil(w/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((h-i)/2)*w
z = ceil((h-i)/2)*w
result.append(max(x,y,z)-min(x,y,z))
print((min(result)))
else:
print((1))
else:
for i in range(1, h-1):
x = i*w
y = (h-i)*floor(w/2)
z = (h-i)*ceil(w/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((h-i)/2)*w
z = ceil((h-i)/2)*w
result.append(max(x,y,z)-min(x,y,z))
for i in range(1, w-1):
x = i*h
y = (w-i)*floor(h/2)
z = (w-i)*ceil(h/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((w-i)/2)*h
z = ceil((w-i)/2)*h
result.append(max(x,y,z)-min(x,y,z))
print((min(result))) | def main():
from math import floor, ceil
h, w = list(map(int, input().split(' ')))
result = []
if h%3 == 0 or w%3 == 0:
print((0))
elif h<3 or w<3:
if h<3 and w>=3:
for i in range(1, w-1):
x = i*h
y = (w-i)*floor(h/2)
z = (w-i)*ceil(h/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((w-i)/2)*h
z = ceil((w-i)/2)*h
result.append(max(x,y,z)-min(x,y,z))
print((min(result)))
elif h>=3 and w<3:
for i in range(1, h-1):
x = i*w
y = (h-i)*floor(w/2)
z = (h-i)*ceil(w/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((h-i)/2)*w
z = ceil((h-i)/2)*w
result.append(max(x,y,z)-min(x,y,z))
print((min(result)))
else:
print((1))
else:
for i in range(1, h-1):
x = i*w
y = (h-i)*floor(w/2)
z = (h-i)*ceil(w/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((h-i)/2)*w
z = ceil((h-i)/2)*w
result.append(max(x,y,z)-min(x,y,z))
for i in range(1, w-1):
x = i*h
y = (w-i)*floor(h/2)
z = (w-i)*ceil(h/2)
result.append(max(x,y,z)-min(x,y,z))
y = floor((w-i)/2)*h
z = ceil((w-i)/2)*h
result.append(max(x,y,z)-min(x,y,z))
print((min(result)))
main() | p03715 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
if H%3==0 or W%3==0:
answer = 0
else:
answer = min(H, W)
# さらに小さくするには縦と横で割る
h = H // 3
area = [h * W, (H-h) * (W//2), (H-h) * ((W+1)//2)]
answer = min(answer, max(area)-min(area))
h += 1
area = [h * W, (H-h) * (W//2), (H-h) * ((W+1)//2)]
answer = min(answer, max(area)-min(area))
w = W // 3
area = [w * H, (W-w) * (H//2), (W-w) * ((H+1)//2)]
answer = min(answer, max(area)-min(area))
w += 1
area = [w * H, (W-w) * (H//2), (W-w) * ((H+1)//2)]
answer = min(answer, max(area)-min(area))
print(answer)
# 13 | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
if H%3==0 or W%3==0:
answer = 0
else:
answer = min(H, W)
# さらに小さくするには縦と横で割る
def cal(H, W):
global answer
h = H // 3
area = [h * W, (H-h) * (W//2), (H-h) * ((W+1)//2)]
answer = min(answer, max(area)-min(area))
h += 1
area = [h * W, (H-h) * (W//2), (H-h) * ((W+1)//2)]
answer = min(answer, max(area)-min(area))
cal(H, W)
cal(W, H)
print(answer)
# 13 | p03715 |
# -*- coding: utf-8 -*-
H,W = list(map(int, input().split()))
ret = 10**9
for h in range(1,H):
w = W//2
s1 = h*W
s2 = (H-h)*w
s3 = (H-h)*(W-w)
ret = min(ret, max(s1,s2,s3)-min(s1,s2,s3))
hh = (H-h)//2
s1 = h*W
s2 = hh*W
s3 = (H-h-hh)*W
ret = min(ret, max(s1,s2,s3)-min(s1,s2,s3))
for w in range(1,W):
h = H//2
s1 = w*H
s2 = (W-w)*h
s3 = (W-w)*(H-h)
ret = min(ret, max(s1,s2,s3)-min(s1,s2,s3))
ww = (W-w)//2
s1 = w*H
s2 = ww*H
s3 = (W-w-ww)*H
ret = min(ret, max(s1,s2,s3)-min(s1,s2,s3))
print(ret)
| h,w = list(map(int, input().split()))
if h%3==0 or w%3==0:
print((0))
exit()
res = min(h,w)
for hi in range(1,h):
b1 = hi*w
b2 = (h-hi)*(w//2)
b3 = (h-hi)*(w//2+w%2)
res = min(res, max(b1,b2,b3)-min(b1,b2,b3))
for wi in range(1,w):
b1 = wi*h
b2 = (w-wi)*(h//2)
b3 = (w-wi)*(h//2+h%2)
res = min(res, max(b1,b2,b3) - min(b1,b2,b3))
print(res)
| p03715 |
def f(x,y):
m=x*(x%3>0)
for i in range(2):
d=x//3+i;e=x-d;l=sorted([d*y,e*(y//2),e*(-~y//2)]);m=min(m,l[2]-l[0])
return m
h,w=list(map(int,input().split()))
print((min(f(h,w),f(w,h)))) | h,w=list(map(int,input().split()));print((min(h//2+w//3+1,h//3+w//2+1,h*(h%3>0)//(2-h%2),w*(w%3>0)//(2-w%2)))) | p03715 |
def main():
H, W = list(map(int, input().split()))
S = H * W
ans = float('inf')
for h1 in range(1,H):
S1 = h1 * W
# 縦に分割する場合
h2 = (H - h1) // 2
S2 = h2 * W
S3 = (H - h1 - h2) * W
ans = min(ans, max(S1,S2,S3) - min(S1,S2,S3))
# 横に分割する場合
w2 = W // 2
w3 = W - w2
S2 = (H - h1) * w2
S3 = (H - h1) * w3
ans = min(ans, max(S1,S2,S3) - min(S1,S2,S3))
for w1 in range(1,W):
S1 = w1 * H
# 横に分割する場合
w2 = (W - w1) // 2
S2 = w2 * H
S3 = (W - w1 - w2) * H
ans = min(ans, max(S1,S2,S3) - min(S1,S2,S3))
# 縦に分割する場合
h2 = H // 2
h3 = H - h2
S2 = (W - w1) * h2
S3 = (W - w1) * h3
ans = min(ans, max(S1,S2,S3) - min(S1,S2,S3))
print(ans)
if __name__ == "__main__":
main() | def main():
H, W = list(map(int, input().split()))
ans = float('inf')
h1, h2, h3 = 0,0,0
w1,w2,w1 = 0,0,0
# 横3に切る場合
h1 = H // 3
h2 = H // 3
h3 = H // 3
if H % 3 == 1:
h3 += 1
elif H % 3 == 2:
h2 += 1
h3 += 1
S = [h1*W,h2*W,h3*W]
ans = min(max(S)-min(S),ans)
# 横2縦1に切る場合
h1 = H // 2
h2 = H // 2
h3 = H
if H % 2 == 1:
h2 += 1
for w in range(1,W):
S = [h1*(W-w),h2*(W-w),h3*w]
ans = min(max(S)-min(S),ans)
# 縦3に切る場合
w1 = W // 3
w2 = W // 3
w3 = W // 3
if W % 3 == 1:
w3 += 1
elif W % 3 == 2:
w2 += 1
w3 += 1
S = [w1*H,w2*H,w3*H]
ans = min(max(S)-min(S),ans)
# 縦1横2に切る場合
w1 = W // 2
w2 = W // 2
w3 = W
if W % 2 == 1:
w2 += 1
for h in range(1,H):
S = [w1*(H-h),w2*(H-h),w3*h]
ans = min(max(S)-min(S),ans)
print(ans)
if __name__ == "__main__":
main() | p03715 |
H,W = list(map(int,input().split()))
min_score = 10**27
for i in range(1,H):
if W%2==0:
S1 = i*W/2
S2 = (H-i)*W
min_score = min(abs(S1-S2),min_score)
else:
S1 = i*(W-1)/2
S2 = i*(W+1)/2
S3 = (H-i)*W
S4 = max(S1,S2,S3)
S5 = min(S1,S2,S3)
min_score = min(S4-S5,min_score)
for i in range(1,W):
if H%2==0:
S1 = i*H/2
S2 = (W-i)*H
min_score = min(abs(S1-S2),min_score)
else:
S1 = i*(H-1)/2
S2 = i*(H+1)/2
S3 = (W-i)*H
S4 = max(S1,S2,S3)
S5 = min(S1,S2,S3)
min_score = min(S4-S5,min_score)
s1=int(H/3)
s2=int((H-s1)/2)
s3=H-s1-s2
S1 = max(s1*W,s2*W,s3*W)
S2 = min(s1*W,s2*W,s3*W)
min_score = min(S1-S2,min_score)
s1=int(W/3)
s2=int((W-s1)/2)
s3=W-s1-s2
S1 = max(s1*H,s2*H,s3*H)
S2 = min(s1*H,s2*H,s3*H)
min_score = min(S1-S2,min_score)
print((int(min_score))) | H,W=list(map(int,input().split()))
min_d=10**27
if H%3==0 or W%3==0:
print((0))
else:
min_d=min(H,W)
for i in range(H+1):
a=i*W
b=(H-i)*(W//2)
c=(H-i)*W - b
min_d = min(max(a,b,c)-min(a,b,c),min_d)
for i in range(W+1):
a=i*H
b=(W-i)*(H//2)
c=(W-i)*H - b
min_d = min(max(a,b,c)-min(a,b,c),min_d)
print(min_d) | p03715 |
h, w = list(map(int, input().split()))
# =パターン
x, y = divmod(h, 3)
if y == 0:
x1, x2, x3 = x, x, x
elif y == 1:
x1, x2, x3 = x+1, x, x
else:
x1, x2, x3 = x+1, x+1, x
s1, s2, s3 = [x*w for x in (x1, x2, x3)]
ans = s1-s3
# llパターン
x, y = divmod(w, 3)
if y == 0:
x1, x2, x3 = x, x, x
elif y == 1:
x1, x2, x3 = x+1, x, x
else:
x1, x2, x3 = x+1, x+1, x
s1, s2, s3 = [x*h for x in (x1, x2, x3)]
ans = min(ans, s1-s3)
# トパターン
x = -(-w//3)
s1 = x*h
y = w-x
x1, x2 = h//2, (h+1)//2
s2, s3 = x1*y, x2*y
Ss = (s1, s2, s3)
ans = min(ans, max(Ss)-min(Ss))
# トパターン
x = w//3
s1 = x*h
y = w-x
x1, x2 = h//2, (h+1)//2
s2, s3 = x1*y, x2*y
Ss = (s1, s2, s3)
ans = min(ans, max(Ss)-min(Ss))
# Tパターン
x = -(-h//3)
s1 = x*w
y = h-x
x1, x2 = w//2, (w+1)//2
s2, s3 = x1*y, x2*y
Ss = (s1, s2, s3)
ans = min(ans, max(Ss)-min(Ss))
# Tパターン
x = h//3
s1 = x*w
y = h-x
x1, x2 = w//2, (w+1)//2
s2, s3 = x1*y, x2*y
Ss = (s1, s2, s3)
ans = min(ans, max(Ss)-min(Ss))
print(ans)
| h, w = list(map(int, input().split()))
def solve_ll(a, b):
x, y = divmod(a, 3)
X = [x]*3
for i in range(y):
X[i] += 1
s1, s2, s3 = [x*b for x in X]
return s1-s3
def solve_T(a, b):
INF = 10**18
res = INF
for x in (b//3, -(-b//3)):
s1 = x*a
y = b-x
x1, x2 = a//2, (a+1)//2
s2, s3 = x1*y, x2*y
Ss = (s1, s2, s3)
res = min(res, max(Ss)-min(Ss))
return res
ans = min(solve_T(h, w), solve_T(w, h), solve_ll(h, w), solve_ll(w, h))
print(ans)
| p03715 |
h, w = list(map(int,input().split()))
m = h * w
def d(a,b,c):
return max(abs(a - b), abs(b - c), abs(a - c))
def c(h,w):
a = m
for i in range(1, h):
l = i * w
y = (h - i) // 2 * w
t = (h - i) * (w // 2)
a = min(a, d(l, y , m - l - y), d(l, t, m - l - t))
return a
print((min(c(h, w), c(w, h))))
| h,w=list(map(int,input().split()))
m=h*w
d=lambda a,b,c:max(abs(a-b),abs(b-c),abs(a-c))
def c(h,w):
a=m
for i in range(1,h):
l=i*w
y=(h-i)//2*w
t=(h-i)*(w//2)
a=min(a,d(l,y,m-l-y),d(l,t,m-l-t))
return a
print((min(c(h,w),c(w,h)))) | p03715 |
# coding: utf-8
# Your code here!
h,w = [int(i) for i in input().split()]
def once(h,w):
res = 10**9
if h > 1:
a,b = h//2*w, (h-h//2)*w
res = abs(a-b)
if w > 1:
c,d = w//2*h, (w-w//2)*h
if abs(c-d) < res:
a,b = c,d
return a,b
def hsaki(h,w):
res = 10**9
for i in range(1,h):
p1 = i*w
p2,p3 = once(h-i,w)
a = max(p1,p2,p3) - min(p1,p2,p3)
res = min(res, a)
# print(p1,p2,p3)
return res
#print(hsaki(h,w), hsaki(w,h))
ans = min(hsaki(h,w), hsaki(w,h))
print(ans) | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
h,w = list(map(int,readline().split()))
def f(h,w):
ans = h*w
for i in range(1,h):
v1 = i*w
if (h-i)%2==0 or w%2 == 0:
v2 = (h-i)*w//2
else:
v2 = max((h-i)//2*w,w//2*(h-i))
v3 = (h-i)*w - v2
ans = min(ans,max(v1,v2,v3)-min(v1,v2,v3))
#print(i,h,w,v1,v2,v3,ans)
return ans
print((min(f(h,w),f(w,h))))
| p03715 |
h,w=list(map(int,input().split()))
if h*w%3:
ans=min(h,w)
for x in range(1,w+1):
ans=min(ans,max(h*x,h//2*(w-x),(h-h//2)*(w-x))-min(h*x,h//2*(w-x),(h-h//2)*(w-x)))
h,w=w,h
for x in range(1,w+1):
ans=min(ans,max(h*x,h//2*(w-x),(h-h//2)*(w-x))-min(h*x,h//2*(w-x),(h-h//2)*(w-x)))
print(ans)
else:print((0)) | h,w=list(map(int,input().split()))
def f(x,y):
ret=(1 if x%3 else 0)*y
for i in range(1,x):
f=sorted((i*y,y//2*(x-i),(1+y)//2*(x-i)))
ret=min(ret,f[2]-f[0])
return ret
print((min(f(h,w),f(w,h)))) | p03715 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
h,w=LI()
if h%3==0 or w%3==0:
return 0
ans=inf
for i in range(1,h):
a=i*w
b=(h-i)*(w//2)
c=(h-i)*(-(-w//2))
ans=min(ans,max([a,b,c])-min([a,b,c]))
a=i*w
b=(h-i)//2*w
c=-(-(h-i)//2)*w
ans=min(ans,max([a,b,c])-min([a,b,c]))
for i in range(1,w):
a=i*h
b=(w-i)*(h//2)
c=(w-i)*(-(-h//2))
ans=min(ans,max([a,b,c])-min([a,b,c]))
a=i*h
b=(w-i)//2*h
c=-(-(w-i)//2)*h
ans=min(ans,max([a,b,c])-min([a,b,c]))
return ans
# main()
print((main()))
| # https://atcoder.jp/contests/arc026/tasks/arc026_2
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
h,w=LI()
ans=inf
for i in range(h+1):
a=i*w
b=(h-i+1)//2*w
c=(h-i)//2*w
ans=min(ans,max(a,b,c)-min(a,b,c))
a=i*w
b=(h-i)*((w+1)//2)
c=(h-i)*(w//2)
ans=min(ans,max(a,b,c)-min(a,b,c))
for i in range(w+1):
a=i*h
b=(w-i+1)//2*h
c=(w-i)//2*h
ans=min(ans,max(a,b,c)-min(a,b,c))
a=i*h
b=(w-i)*((h+1)//2)
c=(w-i)*(h//2)
ans=min(ans,max(a,b,c)-min(a,b,c))
return ans
# main()
print((main()))
| p03715 |
# https://atcoder.jp/contests/arc026/tasks/arc026_2
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
h,w=LI()
ans=inf
for i in range(h+1):
a=i*w
b=(h-i+1)//2*w
c=(h-i)//2*w
ans=min(ans,max(a,b,c)-min(a,b,c))
a=i*w
b=(h-i)*((w+1)//2)
c=(h-i)*(w//2)
ans=min(ans,max(a,b,c)-min(a,b,c))
for i in range(w+1):
a=i*h
b=(w-i+1)//2*h
c=(w-i)//2*h
ans=min(ans,max(a,b,c)-min(a,b,c))
a=i*h
b=(w-i)*((h+1)//2)
c=(w-i)*(h//2)
ans=min(ans,max(a,b,c)-min(a,b,c))
return ans
# main()
print((main()))
| import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
h,w=LI()
ans=[]
h1=h//3
h2=(h-h1)//2
h3=h-(h1+h2)
ans.append(max(h1,h2,h3)*w-min(h1,h2,h3)*w)
w1=w//3
w2=(w-w1)//2
w3=w-(w1+w2)
ans.append(max(w1,w2,w3)*h-min(w1,w2,w3)*h)
mn=inf
for i in range(1,h):
a1=w*i
w1=w//2
a2=w1*(h-i)
w2=w-w1
a3=w2*(h-i)
mn=min(mn,max(a1,a2,a3)-min(a1,a2,a3))
ans.append(mn)
mn=inf
for i in range(1,w):
a1=h*i
h1=h//2
a2=h1*(w-i)
h2=h-h1
a3=h2*(w-i)
mn=min(mn,max(a1,a2,a3)-min(a1,a2,a3))
ans.append(mn)
return min(ans)
# main()
print((main()))
| p03715 |
n,k=int(eval(input())),int(eval(input()));print((sum([min(i*2,(k-i)*2) for i in list(map(int,input().split()))]))) | _,k=eval(input()),int(eval(input()));print((sum([min(i*2,(k-i)*2) for i in list(map(int,input().split()))]))) | p03598 |
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N = int(readline().rstrip())
K = int(readline().rstrip())
X = list(map(int, readline().split()))
half = K / 2
ans = 0
for x in X:
if half < x:
ans += K - x
else:
ans += x
print((ans * 2)) | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N = int(readline().rstrip())
K = int(readline().rstrip())
X = list(map(int, readline().split()))
half = K / 2
ans = 0
for x in X:
ans += min(x, K - x)
ans *= 2
print(ans) | p03598 |
n = int(eval(input()))
k = int(eval(input()))
li = list(map(int, input().split()))
total = 0
for item in li:
total += 2* min(item , k-item)
print(total)
| n = int(eval(input()))
k = int(eval(input()))
x = list(map(int,input().split()))
ans = 0
for i in range(n):
ans += min(x[i],k-x[i])*2
print(ans) | p03598 |
n=int(eval(input()))
k=int(eval(input()))
x=list(map(int,input().split()))
ans=0
for i in range(len(x)):
c2=(k-x[i])*2
x2=x[i]*2
ans+=min(c2,x2)
print(ans) | n=int(eval(input()))
k=int(eval(input()))
x=list(map(int,input().split()))
a=0
for i in range(n):
a+=min(k-x[i],x[i])
print((a*2)) | p03598 |
n = int(eval(input()))
k = int(eval(input()))
x = [int(i) for i in input().split()]
ans = 0
for i in range(n):
ans += 2 * min(x[i],k-x[i])
print(ans) | def main():
N = int(eval(input()))
K = int(eval(input()))
X = [int(i) for i in input().split()]
ans = 0
for x in X:
ans += 2*x if abs(x - 0) < abs(K - x) else abs(K - x) * 2
print(ans)
if __name__ == '__main__':
main()
| p03598 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
k = int(eval(input()))
x_list = list(map(int, input().split()))
count = 0
for i in range(n):
count += min([x_list[i], k-x_list[i]])*2
print((int(count)))
| N = int(eval(input()))
K = int(eval(input()))
X = list(map(int, input().split()))
ans = 0
for i in range(N):
ans += min([X[i], K - X[i]]) * 2
print(ans)
| p03598 |
n = int(eval(input()))
k = int(eval(input()))
x = list(map(int,input().split()))
a = 0
b = 0
c = 0
for i in range(n):
a = x[i] * 2
b = abs(x[i] - k) * 2
c += min(a,b)
print(c) | n = int(eval(input()))
k = int(eval(input()))
x = list(map(int,input().split()))
ans = 0
for i in range(n):
a = x[i] * 2
b = abs(x[i] - k) * 2
ans += min(a,b)
print(ans) | p03598 |
# Author: cr4zjh0bp
# Created: Sat Mar 14 11:48:11 UTC 2020
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()
n, k = nin(2)
x = na()
ans = 0
for i in range(n):
ans += min(abs(x[i] - k) * 2, abs(x[i]) * 2)
print(ans) | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()
n = ni()
k = ni()
x = na()
ans = 0
for i in range(n):
ans += min(abs(x[i]) * 2, abs(x[i] - k) * 2)
print(ans) | p03598 |
N = int(eval(input()))
K = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(N):
ans += min(abs(0-A[i]),abs(K-A[i]))*2
print(ans) | N = int(eval(input()))
K = int(eval(input()))
X = list(map(int,input().split()))
ans = 0
for i in range(1,N+1):
A = abs(X[i-1])
B = abs(K-X[i-1])
ans += 2*(min(A,B))
print(ans) | p03598 |
_,k,*x=list(map(int,open(0).read().split()));print((sum(min(t,k-t)*2for t in x))) | _,k,t=open(0);print((sum(min(x,int(k)-x)*2for x in map(int,t.split())))) | p03598 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
k = int(input().rstrip('\n'))
x = list(map(int, input().rstrip('\n').split()))
t = 0
for v in x:
t += (min(v, abs(k - v)) * 2)
print(t)
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
k = int(input().rstrip('\n'))
x = list(map(int, input().rstrip('\n').split()))
t = 0
for i in range(n):
t += (min(abs(x[i]), abs(k - x[i])) * 2)
print(t)
if __name__ == '__main__':
slove()
| p03598 |
N = int(eval(input())) # ボールの数
K = int(eval(input())) # Bの位置
xs = [int(i) for i in input().split()] # ボールの位置
half = K / 2
total = 0
for x in xs:
if x < half:
total += 2*x
else:
total += 2*(K-x)
print(total)
| N = int(eval(input())) # ボールの数
K = int(eval(input())) # Bの位置
xs = [int(i) for i in input().split()] # ボールの位置
half = K / 2
total = 0
for x in xs:
if x < half:
total += x
else:
total += (K-x)
# 最後に二倍すればよい
print((2*total))
| p03598 |
n = int(eval(input()))
k = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
for xi in x:
ans += min(xi, k - xi) * 2
print(ans) | n = int(eval(input()))
k = int(eval(input()))
ans = 0
x = list(map(int, input().split()))
for v in x:
ans += min(v, k - v) * 2
print(ans) | p03598 |
n = int(eval(input()))
k = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
for i in x:
ans += min(abs(i-0),abs(i-k))*2
print(ans) | n = int(eval(input()))
k = int(eval(input()))
xl = list(map(int, input().split()))
ans = 0
for i in xl:
ans+= min(abs(i-0), abs(k-i))*2
print(ans) | p03598 |
N = int(eval(input()))
K = int(eval(input()))
X = list(map(int,input().split()))
ans = 0
k = int(K/2)
for x in X:
if(x > k):
ans += (K-x) * 2
else:
ans += x * 2
print(ans) | N = int(eval(input()))
K = int(eval(input()))
X = list(map(int,input().split()))
cnt = 0
for x in X:
if(x > K//2):
cnt += (K-x)*2
else:
cnt += x*2
print(cnt) | p03598 |
def resolve():
N = int(eval(input()))
K = int(eval(input()))
x = list(map(int, input().split()))
sum = 0
for i in range(N):
if abs(K-x[i]) > x[i]:
sum += x[i]*2
else:
sum += abs(K-x[i])*2
print(sum)
resolve()
| def resolve():
N = int(eval(input()))
K = int(eval(input()))
x = list(map(int, input().split()))
sum = 0
for i in range(N):
if K-x[i] > x[i]:
sum += x[i]*2
else:
sum += (K-x[i])*2
print(sum)
resolve()
| p03598 |
_ = eval(input())
k = int(eval(input()))
x = [int(x) for x in input().split()]
ans = 0
for i in x:
ans += min(i, k - i) * 2
else:
print(ans) | _ = eval(input())
k = int(eval(input()))
x = [int(x) for x in input().split()]
ans = 0
for i in x:
ans += min(i, k - i)
else:
print((ans * 2)) | p03598 |
from collections import Counter
def get_par(x, par_lst):
if x == par_lst[x]:
return x
ret = get_par(par_lst[x], par_lst)
#par_lst[x] = ret
return ret
def main():
while True:
n, m = list(map(int, input().split()))
if n == 0:
break
par_lst = [i for i in range(n)]
counter = Counter()
flag = False
if m == 0:
print("yes")
continue
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
counter[u] += 1
counter[v] += 1
pu, pv = get_par(u, par_lst), get_par(v, par_lst)
if pu == pv:
flag = True
else:
par_lst[pu] = pv
if counter.most_common()[0][1] > 2:
flag = True
if flag:
print("no")
else:
print("yes")
main()
| from collections import Counter
def get_par(x, par_lst):
if x == par_lst[x]:
return x
ret = get_par(par_lst[x], par_lst)
par_lst[x] = ret
return ret
def main():
while True:
n, m = list(map(int, input().split()))
if n == 0:
break
par_lst = [i for i in range(n)]
counter = [0] * n
flag = False
for _ in range(m):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
counter[u] += 1
counter[v] += 1
pu, pv = get_par(u, par_lst), get_par(v, par_lst)
if pu == pv:
flag = True
else:
par_lst[pu] = pv
if max(counter) > 2:
flag = True
if flag:
print("no")
else:
print("yes")
main()
| p00248 |
import sys
import heapq
import math
N, K = list(map(int, sys.stdin.readline().rstrip().split()))
A = list(map(int, sys.stdin.readline().rstrip().split()))
F = list(map(int, sys.stdin.readline().rstrip().split()))
A.sort()
F.sort()
cost = []
for i in range(N):
cost.append((-A[i] * F[N - 1 - i], A[i], F[N - 1 - i], A[i]))
heapq.heapify(cost)
while K > 0:
max_1, a_1, f_1, nokori_1 = heapq.heappop(cost)
max_2, a_2, f_2, nokori_2 = heapq.heappop(cost)
if max_1 == 0:
break
c = math.ceil((max_2 - max_1 + 1) / f_1)
num = min(K, c)
if num <= nokori_1:
heapq.heappush(cost, (min(max_1 + f_1 * num, 0), a_1, f_1, nokori_1 - num))
heapq.heappush(cost, (max_2, a_2, f_2, nokori_2))
K -= num
else:
heapq.heappush(cost, (min(max_1 + f_1 * a_1, 0), a_1, f_1, nokori_1 - a_1))
heapq.heappush(cost, (max_2, a_2, f_2, nokori_2))
break
print((-cost[0][0])) | import sys
import math
N, K = list(map(int, sys.stdin.readline().rstrip().split()))
A = list(map(int, sys.stdin.readline().rstrip().split()))
F = list(map(int, sys.stdin.readline().rstrip().split()))
A.sort()
A = A[::-1]
F.sort()
def test(x):
res = 0
for i in range(N):
t = A[i] * F[i]
if t > x:
res += math.ceil((t - x) / F[i])
return res <= K
ng = -1
ok = 10**18
while ng + 1 < ok:
mid = (ng + ok) // 2
if test(mid):
ok = mid
else:
ng = mid
print(ok) | p02883 |
import copy
from heapq import heappop, heapify, heappush
import math
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
F = [int(i) for i in input().split()]
ans = 0
A.sort(reverse=True)
F.sort()
s = []
for i in range(N):
s.append([A[i]*F[i], A[i], F[i]])
s.sort(reverse=True, key=lambda x: x[0])
def f(l, T):
cur = 0
num = 0
S = copy.deepcopy(l)
while cur <= K:
if num == N:
break
a, b, c = S[num]
if a <= T:
break
cur += math.ceil((a - T)/c)
num += 1
if cur <= K:
return True
else:
return False
ok, ng = s[0][0], -1
while abs(ok-ng) > 1:
mid = (ok+ng)//2
if f(s, mid) == True:
ok = mid
else:
ng = mid
print(ok) | def main():
import copy
from heapq import heappop, heapify, heappush
import math
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
F = [int(i) for i in input().split()]
ans = 0
A.sort(reverse=True)
F.sort()
s = []
for i in range(N):
s.append([A[i]*F[i], A[i], F[i]])
s.sort(reverse=True, key=lambda x: x[0])
def f(S, T):
cur = 0
num = 0
while cur <= K:
if num == N:
break
a, b, c = S[num]
if a <= T:
break
cur += math.ceil((a - T)/c)
num += 1
if cur <= K:
return True
else:
return False
ok, ng = s[0][0], -1
while abs(ok-ng) > 1:
mid = (ok+ng)//2
if f(s, mid) == True:
ok = mid
else:
ng = mid
print(ok)
if __name__ == '__main__':
main() | p02883 |
import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
if K >= sum(A):
print((0))
exit()
A.sort(reverse=True)
F.sort()
def is_ok(mid):
cnt = 0
for i in range(N):
if A[i] * F[i] <= mid:
continue
else:
cnt += math.ceil((A[i] * F[i] - mid) / F[i]) # A[i]が1減少するごとにF[i]減るのでF[i]で割る
return cnt <= K
# okは全員がX以下になる最小値に着地するので、A*F<=10**12 なので＋１して最大のケースにも対応する
ok = 10**12 + 1
# 0ではないことが上で保証されてるので、条件を満たさない最大値の0にしておく
ng = 0
while ok - ng > 1:
mid = (ok + ng) // 2
#print(ok,ng,mid)
if is_ok(mid):
ok = mid
else:
ng = mid
#print(ok,ng,mid)
print(ok) | """
AtCoder Beginner Contest 144 E - Gluttony
愚直解
・修行の順序は結果に影響しないから、修行を誰に割り振るか：N^K
・メンバーN人をどの問題に当てるか（N人の並べ方）：N!
-> N^K * N!
間に合わない。
完食にかかる時間のうち最大値がチーム全体の成績なので、
・消化コストAiを修行で下げる
・消化コストAiの大きい人に、食べにくさFiの小さい食べ物を割り当てる
のが良さそう
最大値の最小化、なので、二分探索が使えそうな気もする。
A,F <= 10^6
かかる時間を X 以下にできるか、を考える。
・消化コストが大きい人に、食べにくさが小さい問題を当てるようにする
・Ai * Fi > Xであれば、(Ai - m) * Fi <= X となるような最小のmをカウントする
全メンバーに対しこれを数え上げた時に、
mの合計 > K
であれば、X以下になるように修行することができない（K回までしか修行できず、回数が足りない）ので、最大値の最小はXより上
mの合計 <= K
であれば、X以下になるように修行できるので、最大値の最小はX以下
A*F <= 10^12 までなので、40~50程度繰り返せば行けそう
"""
import math
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
if K >= sum(A):
print((0))
exit()
A.sort(reverse=True)
F.sort()
def is_ok(mid):
cnt = 0
for i in range(N):
if A[i] * F[i] <= mid:
continue
else:
cnt += math.ceil((A[i] * F[i] - mid) / F[i]) # A[i]が1減少するごとにF[i]減るのでF[i]で割る
return cnt <= K
# okは全員がX以下になる最小値に着地するので、A*F<=10**12 なので＋１して最大のケースにも対応する
ok = 10**12 + 1
# 0ではないことが上で保証されてるので、条件を満たさない最大値の0にしておく
ng = 0
while ok - ng > 1:
mid = (ok + ng) // 2
#print(ok,ng,mid)
if is_ok(mid):
ok = mid
else:
ng = mid
#print(ok,ng,mid)
print(ok) | p02883 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
F=list(map(int,input().split()))
if N==1:
ans=max(A[0]-K,0)*F[0]
else:
F.sort(reverse=True) # 降順で固定
A.sort()
# print(f'F={F}')
# print(A)
while K>0 and A[-1]>0:
# print(f'A={A}')
S=sorted([(A[i]*F[i],i) for i in range(N)],reverse=True)
# print(f'S={S}') #DB
xym=S[0][0];xys=S[1][0]
m=S[0][1];s=S[1][1]
if xym==xys>0:
A[m]-=1
K-=1
else:
d=xym-xys
p=min((d+(F[m]-1))//F[m],K,A[m])
A[m]-=p # 負にならない
K-=p
A.sort()
S=sorted([(A[i]*F[i],i) for i in range(N)],reverse=True)
ans=max(S)[0]
print(ans) | def p(F,A,s): # スコアをsにするために最小限必要な修行の回数
res=0
for i in range(N):
res+=max(A[i]-s//F[i],0)
return res
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
F=list(map(int,input().split()))
F.sort(reverse=True) # 降順で固定
A.sort() # 昇順で固定
l=0
r=max([F[i]*A[i] for i in range(N)])
while r-l>1:
m=(l+r)//2
if p(F,A,m)<=K:
r=m
else:
l=m
if r>1 or p(F,A,0)>K:
ans=r
else:
ans=0
print(ans) | p02883 |
import math
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
a.reverse()
f.sort()
totalnum=sum(a)
maxproduct=0
for i in range(n):
maxproduct=max(f[i]*a[i],maxproduct)
l1=0
r1=maxproduct
while True:
l2=l1
r2=(l1+r1)//2
if l2==r2:
break
counter=0
for i in range(n):
c=math.floor(r2/f[i])
while (c+1)*f[i]<=r2:
c+=1
counter+=max(0,a[i]-c)
if counter<=k:
r1=r2
else:
l1=r2
if l1==r1:
print(r2)
else:
counter=0
r2=l1
for i in range(n):
c=math.floor(r2/f[i])
while (c+1)*f[i]<=r2:
c+=1
counter+=max(0,a[i]-c)
if counter<=k:
print(l1)
else:
print(r1) | import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
a.reverse()
f.sort()
maxproduct=0
for i in range(n):
maxproduct=max(f[i]*a[i],maxproduct)
l1=0
r1=maxproduct
while True:
l2=l1
r2=(l1+r1)//2
if l2==r2:
break
counter=0
for i in range(n):
c=r2//f[i]
while (c+1)*f[i]<=r2:
c+=1
counter+=max(0,a[i]-c)
if counter<=k:
r1=r2
else:
l1=r2
if l1==r1:
print(r2)
else:
counter=0
r2=l1
for i in range(n):
c=r2//f[i]
while (c+1)*f[i]<=r2:
c+=1
counter+=max(0,a[i]-c)
if counter<=k:
print(l1)
else:
print(r1) | p02883 |
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
a.reverse()
f.sort()
maxproduct=0
for i in range(n):
maxproduct=max(f[i]*a[i],maxproduct)
l1=0
r1=maxproduct
while True:
l2=l1
r2=(l1+r1)//2
if l2==r2:
break
counter=0
for i in range(n):
c=r2//f[i]
while (c+1)*f[i]<=r2:
c+=1
counter+=max(0,a[i]-c)
if counter<=k:
r1=r2
else:
l1=r2
if l1==r1:
print(r2)
else:
counter=0
r2=l1
for i in range(n):
c=r2//f[i]
while (c+1)*f[i]<=r2:
c+=1
counter+=max(0,a[i]-c)
if counter<=k:
print(l1)
else:
print(r1) | import sys
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
f.sort()
f.reverse()
if sum(a)<=k:
print((0))
sys.exit()
pointer=0
l=0
r=0
for i in range(n):
r=max(r,a[i]*f[i])
while l+1<r:
try1=(r+l)//2
required=0
for i in range(n):
required+=(max(0,a[i]-try1//f[i]))
if required>k:
l=try1
else:
r=try1
required=0
for i in range(n):
required+=(max(0,a[i]-l//f[i]))
if required>k:
print(r)
else:
print(l) | p02883 |
import sys
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
f.sort()
f.reverse()
if sum(a)<=k:
print((0))
sys.exit()
pointer=0
l=0
r=0
for i in range(n):
r=max(r,a[i]*f[i])
while l+1<r:
try1=(r+l)//2
required=0
for i in range(n):
required+=(max(0,a[i]-try1//f[i]))
if required>k:
l=try1
else:
r=try1
required=0
for i in range(n):
required+=(max(0,a[i]-l//f[i]))
if required>k:
print(r)
else:
print(l) | import sys
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
f.sort()
f.reverse()
if sum(a)<=k:
print((0))
sys.exit()
pointer=0
l=0
r=0
for i in range(n):
r=max(r,a[i]*f[i])
while l+1<r:
try1=(l+r)//2
required=0
for i in range(n):
required+=(max(0,a[i]-try1//f[i]))
if required>k:
l=try1
else:
r=try1
required=0
for i in range(n):
required+=(max(0,a[i]-l//f[i]))
if required>k:
print(r)
else:
print(l)
| p02883 |
import heapq
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
K = min(K, sum(A))
X = [[-a * f, a, f] for a, f in zip(A, F)]
heapq.heapify(X)
cnt = 0
while K:
cost, a, f = heapq.heappop(X)
if a == 0:
heapq.heappush(X, [-a * f, new_a, f])
continue
new_a = a - 1
heapq.heappush(X, [-new_a * f, new_a, f])
K -= 1
X.sort()
print((-X[0][0]))
| from math import ceil
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
K = min(K, sum(A))
X = [[a, f] for a, f in zip(A, F)]
ok, ng = 10 ** 12 + 1, -1
while abs(ok - ng) > 1:
m = (ok + ng) // 2
k_cost = 0
for a, f in X:
if a * f <= m:
continue
else:
k_cost += max(0, ceil(-(m / f - a)))
if k_cost <= K:
ok = m
else:
ng = m
print(ok)
| p02883 |
import sys
N, K = map(int,input().split())
Alist = list(map(int,input().split()))
Flist = list(map(int,input().split()))
Alist.sort()
sum_Alist = 0
for i in range(N):
sum_Alist += Alist[i]
print(Alist,Flist,file=sys.stderr)
if sum_Alist <= K:
print(0)
exit()
maxtime = max(Alist)*max(Flist)
mintime = -1
print(maxtime,mintime,file=sys.stderr)
while mintime+1 < maxtime:
mid = (mintime+maxtime)//2
sum_midlist = 0
max_midlist = 0
midlist = [0 for i in range(N)]
for i in range(N):
midlist[i] = mid//Flist[i]
midlist.sort()
for i in range(N):
if midlist[i] < Alist[i]:
sum_midlist += Alist[i]-midlist[i]
#print(maxtime,mintime,sum_midlist,file=sys.stderr)
if sum_midlist <= K:
maxtime = mid
else:
mintime = mid
print(maxtime)
| import sys
N, K = map(int,input().split())
Alist = list(map(int,input().split()))
Flist = list(map(int,input().split()))
Alist.sort()
sum_Alist = 0
for i in range(N):
sum_Alist += Alist[i]
print(Alist,Flist,file=sys.stderr)
if sum_Alist <= K:
print(0)
exit()
maxtime = max(Alist)*max(Flist)
mintime = -1
print(maxtime,mintime,file=sys.stderr)
midlist = [0 for i in range(N)]
while mintime+1 < maxtime:
mid = (mintime+maxtime)//2
sum_midlist = 0
max_midlist = 0
for i in range(N):
midlist[i] = mid//Flist[i]
midlist.sort()
for i in range(N):
if midlist[i] < Alist[i]:
sum_midlist += Alist[i]-midlist[i]
#print(maxtime,mintime,sum_midlist,file=sys.stderr)
if sum_midlist <= K:
maxtime = mid
else:
mintime = mid
print(maxtime)
| p02883 |
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())))[::-1]
B = sum(A)
## 修行前の最短: M
M = max([a*f for a, f in zip(A, F)])
def is_possible(x):
return B - sum([min(a, x//f) for a, f in zip(A, F)]) <= K
## 2分探索
left = -1
right = M
while left + 1 < right:
mid = (left + right)//2
if is_possible(mid):
right = mid
else:
left = mid
print(right) | N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())))[::-1]
## 修行前の最短: M
M = max([a*f for a, f in zip(A, F)])
## 積の最小をxにできるか。
## x//f以下である必要がある。
def is_possible(x):
return sum([max(0, a-x//f) for a, f in zip(A, F)]) <= K
## 2分探索
left = -1
right = M
while left + 1 < right:
mid = (left + right)//2
if is_possible(mid):
right = mid
else:
left = mid
print(right) | p02883 |
import heapq
n, k = list(map(int, input().split()))
a_list = [int(i) for i in input().split()]
f_list = [int(i) for i in input().split()]
a_list.sort()
f_list.sort(reverse=True)
heap_list = []
for i in range(n):
heap_list.append((-a_list[i] * f_list[i], f_list[i]))
heapq.heapify(heap_list)
for i in range(k):
max_v, f = heapq.heappop(heap_list)
if max_v < 0:
max_v = min(max_v + f, 0)
heapq.heappush(heap_list, (max_v, f))
max_v, f = heapq.heappop(heap_list)
print((-max_v)) | n, k = list(map(int, input().split()))
a_list = [int(i) for i in input().split()]
f_list = [int(i) for i in input().split()]
a_list.sort(reverse=True)
f_list.sort()
if k >= sum(a_list):
print((0))
exit()
point = []
for i in range(n):
point.append(a_list[i] * f_list[i])
import math
def binary_search(point, k):
left = 0
right = 10 ** 12
while left + 1< right:
ans = 0
center = (left + right) // 2
for i in range(n):
if point[i] > center:
ans += a_list[i] - (center // f_list[i])
if ans <= k:
right = center
else:
left = center
return right
value = binary_search(point, k)
print(value) | p02883 |
import math
N,K,*AF = list(map(int, open(0).read().split()))
A = sorted(AF[:N])
F = sorted(AF[N:],reverse=True)
left = 0
right = max(A) * max(F)
while left != right:
mid = (left+right) // 2
if sum([max(A[i]-math.floor(mid/F[i]),0) for i in range(N)]) <= K:
right = mid
else:
left = mid + 1
print(left) | import math
N,K,*AF = list(map(int, open(0).read().split()))
A = sorted(AF[:N])
F = sorted(AF[N:],reverse=True)
left = 0
right = max(A) * max(F)
while left != right:
mid = (left+right) // 2
temp = 0
for i in range(N):
temp += max(A[i]-math.floor(mid/F[i]),0)
if temp > K:
left = mid + 1
break
else:
right = mid
print(left) | p02883 |
import sys
input = sys.stdin.readline
import heapq
def main():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
F = [int(x) for x in input().split()]
A_s = sorted(A, reverse=True)
F_s = sorted(F)
C = []
C_h = []
for i in range(N):
x = A_s[i] * F_s[i]
C.append(x)
heapq.heappush(C_h, -x)
for _ in range(K):
x = -heapq.heappop(C_h)
i = C.index(x)
A_s[i] -= 1
y = A_s[i] * F_s[i]
C[i] = y
heapq.heappush(C_h, -y)
x = -heapq.heappop(C_h)
print(x)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
def check(A, F, mid, k):
for i in range(len(A)):
if A[i] * F[i] > mid:
x = A[i] - mid // F[i]
k -= x
if k < 0:
return False
return True
def main():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
F = [int(x) for x in input().split()]
A_s = sorted(A, reverse=True)
F_s = sorted(F)
l = -1
r = 10 ** 13
while r - l != 1:
mid = (r + l) // 2
if check(A_s, F_s, mid, K):
r = mid
else:
l = mid
print(r)
if __name__ == '__main__':
main()
| p02883 |
def resolve():
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
F = sorted(list(map(int, input().split())))
q = []
for i in range(N):
q.append((-A[i]*F[i], A[i], F[i]))
import heapq
heapq.heapify(q)
for i in range(K):
time, a, f = heapq.heappop(q)
# print("###########")
# print(time, a, f)
if a <= 0:
print((0))
return
heapq.heappush(q, (-(a-1)*f, a-1, f))
# print(-(a-1)*f, a-1, f)
time, _, __ = heapq.heappop(q)
print((-time))
if __name__ == "__main__":
resolve()
| def resolve():
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
q = []
for i in range(N):
q.append((A[i]*F[i], A[i], F[i]))
def isok(time):
total = 0
for t, a, f in q:
acc = time // f
if acc < a:
total += a - acc
return True if total <= K else False
left = -1
right = A[-1]*F[0]
while (right - left > 1):
mid = left + (right - left) // 2
if isok(mid):
right = mid
else:
left = mid
print(right)
if __name__ == "__main__":
resolve()
| p02883 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.sort()
b.sort(reverse=True)
#print(a)
#print(b)
c = []
for i in range(n):
c.append([-a[i]*b[i],b[i]])
#print(c)
import heapq
heapq.heapify(c)
cnt = 0
while True:
now = heapq.heappop(c)
if now[0] == 0:
heapq.heappush(c,now)
break
red = (c[0][0] - now[0]) // now[1]
#print(red)
if red > k - cnt:
heapq.heappush(c, [now[0]+(k-cnt)*now[1],now[1]] )
break
elif red == 0:
heapq.heappush(c, [now[0]+now[1],now[1]] )
cnt += 1
else:
heapq.heappush(c, [now[0]+red*now[1],now[1]] )
cnt += red
if k == cnt:
break
#print(cnt,c)
#print(c)
ans = 0
for i in range(n):
if ans > c[i][0]:
ans = c[i][0]
print((-1*ans)) | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.sort()
b.sort(reverse=True)
#print(a)
#print(b)
big = 44
stand = 2 ** big
width = 2 ** (big-1)
if sum(a) <= k:
print((0))
else:
while True:
tmp = []
for i in range(n):
tmp.append(max(0,a[i]-stand//b[i]))
if width == 0:
if sum(tmp) <= k:
print(stand)
else:
print((stand+1))
break
if sum(tmp) <= k:
stand -= width
width //= 2
else:
stand += width
width //= 2
#print(stand,tmp) | p02883 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.sort()
b.sort(reverse=True)
#print(a)
#print(b)
big = 44
stand = 2 ** big
width = 2 ** (big-1)
if sum(a) <= k:
print((0))
else:
while True:
tmp = []
for i in range(n):
tmp.append(max(0,a[i]-stand//b[i]))
if width == 0:
if sum(tmp) <= k:
print(stand)
else:
print((stand+1))
break
if sum(tmp) <= k:
stand -= width
width //= 2
else:
stand += width
width //= 2
#print(stand,tmp) | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = list(map(int,input().split()))
a.sort()
f.sort(reverse=True)
#print(a)
#print(f)
scale = 42
aim = 2 ** scale -1
gap = 2 ** (scale-1)
while True:
train = 0
for i in range(n):
train += max(0, a[i] - aim//f[i])
if gap == 0:
if train <= k:
print(aim)
else:
print((aim+1))
break
#print(aim,gap,train)
if train <= k:
aim -= gap
gap //= 2
else:
aim += gap
gap //= 2 | p02883 |
#coding:utf-8
import sys
import bisect
import math
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())
XLMIIS = lambda x : [LMIIS() for _ in range(x)]
n, k = LMIIS()
aa = LMIIS()
ff = LMIIS()
aa.sort(reverse=True)
ff.sort()
a = tuple(aa)
f = tuple(ff)
max_ = 10**12
min_ = 0
while max_ != min_ + 1:
x = (max_ + min_) // 2
shugyo = 0
for i in range(n):
shugyo += max(0, a[i] - x // f[i])
if shugyo <= k:
max_ = x
else:
min_ = x
if x == min_:
x += 1
if sum(a) <= k:
x = 0
print(x)
if __name__ == '__main__':
main()
| #coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True
def main(given = sys.stdin.readline):
input = lambda : given().rstrip()
LMIIS = lambda : list(map(int,input().split()))
II = lambda : int(input())
XLMIIS = lambda x : [LMIIS() for _ in range(x)]
n, k = LMIIS()
aa = LMIIS()
ff = LMIIS()
aa.sort(reverse=True)
ff.sort()
a = tuple(aa)
f = tuple(ff)
max_ = 10**12
min_ = 0
while max_ != min_ + 1:
x = (max_ + min_) // 2
shugyo = 0
for i in range(n):
shugyo += max(0, a[i] - x // f[i])
if shugyo <= k:
max_ = x
else:
min_ = x
if x == min_:
x += 1
if sum(a) <= k:
x = 0
print(x)
if __name__ == '__main__':
main()
| p02883 |
from heapq import *
def abc144c():
n,k=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
f=sorted(list(map(int,input().split())))[::-1]
q=[]
for i,j in zip(a,f):
heappush(q,(-i*j,j))
for i in range(k):
tmp,key=heappop(q)
heappush(q,(tmp+key,key))
ans,key=heappop(q)
print((max(-ans,0)))
abc144c()
| n,k=list(map(int,input().split()))
abilities=sorted(list(map(int,input().split())))
foods=sorted(list(map(int,input().split())),reverse=True)
if sum(abilities)<=k:
print((0))
exit()
def check(score):
ret=0
for a,f in zip(abilities,foods):
ret+=max(0,(a*f-score+f-1)//f)
return ret<=k
ok=10**12+1
ng=0
for _ in range(50):
mid=(ok+ng)//2
if check(mid):
ok=mid
else:
ng=mid
print(ok)
| p02883 |
n,k=list(map(int,input().split()))
abilities=sorted(list(map(int,input().split())))
foods=sorted(list(map(int,input().split())),reverse=True)
if sum(abilities)<=k:
print((0))
exit()
def check(score):
ret=0
for a,f in zip(abilities,foods):
ret+=max(0,(a*f-score+f-1)//f)
return ret<=k
ok=10**12+1
ng=0
for _ in range(50):
mid=(ok+ng)//2
if check(mid):
ok=mid
else:
ng=mid
print(ok)
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
f.sort(reverse=True)
def check(s):
ret=0
for i,j in zip(a,f):
ret+=max(0,i-s//j)
return ret<=k
ok=10**12+1
ng=-1
while ok-ng>1:
mid=(ok+ng)//2
if check(mid):
ok=mid
else:
ng=mid
print(ok) | p02883 |
import heapq
import sys
input = sys.stdin.readline
class AtCoder:
def __lt__(self, other):
return self[0] < other[0]
def main(self):
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
hq = []
heapq.heapify(hq)
for i in range(N):
heapq.heappush(hq, (-1 * A[i] * F[i], (F[i], A[i])))
while K > 0:
score = heapq.heappop(hq)
if score[1][1] == 0:
print((0))
exit()
else:
if score[1][1] - F[0] > 0:
K -= score[1][1] - F[0]
new_A = F[0]
else:
K -= 1
new_A = score[1][1] - 1
heapq.heappush(hq, (-1 * new_A * score[1][0], (score[1][0], new_A)))
print((-1 * heapq.heappop(hq)[0]))
# Run main
if __name__ == '__main__':
AtCoder().main()
| import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
l, r = -1, 10 ** 12
while l + 1 < r:
mid = (l + r) // 2
s = 0
for i in range(N):
s += max(0, A[i] - mid // F[i])
if s <= K:
r = mid
else:
l = mid
print(r)
# Run main
if __name__ == '__main__':
AtCoder().main()
| p02883 |
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
F = sorted(list(map(int, input().split())))
def binary_search(min_n, max_n):
while max_n - min_n != 1:
tn = (min_n + max_n) // 2
if judge(tn):
max_n = tn
else:
min_n = tn
return max_n
def judge(tn):
k = 0
for i in range(N):
if A[i] * F[i] > tn:
k += A[i] - (tn // F[i])
if k > K:
return False
return True
def solve():
ans = binary_search(-1, 10**12)
print(ans)
if __name__ == '__main__':
solve()
| import sys
input = lambda: sys.stdin.readline().rstrip()
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
F = sorted(list(map(int, input().split())))
def binary_search(min_n, max_n):
while max_n - min_n != 1:
tn = (min_n + max_n) // 2
if judge(tn):
max_n = tn
else:
min_n = tn
return max_n
def judge(tn):
k = 0
for i in range(N):
if A[i] * F[i] > tn:
k += A[i] - (tn // F[i])
if k > K:
return False
return True
def solve():
ans = binary_search(-1, 10**12)
print(ans)
if __name__ == '__main__':
solve()
| p02883 |
import math
def cal(sum_, F, N, K, d):
count = 0
for i in range(N):
if sum_[i] > d:
count += math.ceil((sum_[i] - d) / F[i])
if count > K:
#作ることができない
return False
return True
def main():
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
F = [int(i) for i in input().split()]
A.sort()
F.sort(reverse=True)
sum_ = []
for i in range(N):
sum_.append(A[i] * F[i])
right = 10 ** 12
left = 0
count = 0
pre_mid = 0
while count < 100:
mid = (right + left) // 2
if pre_mid == mid:
break
if cal(sum_, F, N, K, mid):
# midを小さくすることができる
right = mid
else:
# midを大きくしなければならない
left = mid + 1
pre_mid = mid
count += 1
print(mid)
if __name__ == "__main__":
main()
| import math
def cal(sum_, F, N, K, d):
count = 0
for i in range(N):
if sum_[i] > d:
count += math.ceil((sum_[i] - d) / F[i])
if count > K:
#作ることができない
return False
return True
def main():
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
F = [int(i) for i in input().split()]
A.sort()
F.sort(reverse=True)
sum_ = []
for i in range(N):
sum_.append(A[i] * F[i])
right = 10 ** 12
left = 0
count = 0
pre_mid = 0
while True:
mid = (right + left) // 2
if pre_mid == mid:
break
if cal(sum_, F, N, K, mid):
# midを小さくすることができる
right = mid
else:
# midを大きくしなければならない
left = mid + 1
pre_mid = mid
count += 1
print(mid)
if __name__ == "__main__":
main()
| p02883 |
# https://atcoder.jp/contests/abc144/tasks/abc144_e
# 修行を行わないときに最適なのは両方を逆順でソートしておくこと
# そうしたときになるべく食べ物のコストの大きい方から修行していったほうが最適なので
# greedyにKをみたすまで引いてあげる
# 求めたいのは最大値！
# 最小はxにできると仮定してみる？
# 答えはxより小さくなる→greedyに(Ai-a)Fi<xして判定すれば良い
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
N, K = read_ints()
A = read_ints()
F = read_ints()
A.sort() # 前からFの大きい順に対処していく人になっている
F.sort(reverse=True)
# print(A)
# print([x * y for x, y in zip(A, F)]) # ここから崩すことができるポイントを探せる
from math import ceil
def is_ok(x, K):
for i in range(N):
if A[i] * F[i] <= x:
continue
a = ceil(A[i] - x / F[i]) # Kから使うべき個数
K -= a
if K < 0:
return False
return K > -1
def meguru_bisect(ng, ok):
'''
define is_okと
初期値のng,okを受け取り,is_okを満たす最小(最大)のokを返す
ng ok は とり得る最小の値-1 とり得る最大の値+1
最大最小が逆の場合はよしなにひっくり返す
'''
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(mid, K):
ok = mid
else:
ng = mid
return ok
print((meguru_bisect(-1, 10**12 + 1)))
| # https://atcoder.jp/contests/abc144/tasks/abc144_e
# 修行を行わないときに最適なのは両方を逆順でソートしておくこと
# そうしたときになるべく食べ物のコストの大きい方から修行していったほうが最適なので
# greedyにKをみたすまで引いてあげる
# 求めたいのは最大値！
# 最小はxにできると仮定してみる？
# 答えはxより小さくなる→greedyに(Ai-a)Fi<xして判定すれば良い
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
N, K = read_ints()
A = read_ints()
F = read_ints()
A.sort() # 前からFの大きい順に対処していく人になっている
F.sort(reverse=True)
# print(A)
# print([x * y for x, y in zip(A, F)]) # ここから崩すことができるポイントを探せる
def is_ok(x, K):
for i in range(N):
if A[i] * F[i] <= x:
continue
a = A[i] - (x // F[i]) # Kから使うべき個数
K -= a
if K < 0:
return False
return K > -1
def meguru_bisect(ng, ok):
'''
define is_okと
初期値のng,okを受け取り,is_okを満たす最小(最大)のokを返す
ng ok は とり得る最小の値-1 とり得る最大の値+1
最大最小が逆の場合はよしなにひっくり返す
'''
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(mid, K):
ok = mid
else:
ng = mid
return ok
print((meguru_bisect(-1, 10**12 + 1)))
| p02883 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
def is_ok(x):
c = 0
for i in range(n):
a = A[i]
f = F[i]
if a >= x//f:
c += a-x//f
if c <= k:
return True
else:
return False
if is_ok(0):
print((0))
exit()
l = 0
r = 10**18
while l+1 < r:
c = (l+r)//2
if is_ok(c):
r = c
else:
l = c
print(r)
| n,k = list(map(int, input().split()))
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort()
F.sort(reverse=True)
def is_ok(x):
c = 0
for a, f in zip(A, F):
c += max(0, a-x//f)
if c <= k:
return True
else:
return False
ng = -1
ok = 10**18
while ng+1 < ok:
c = (ng+ok)//2
if is_ok(c):
ok = c
else:
ng = c
print(ok)
| p02883 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort()
f.sort(reverse=True)
left, right = -1, a[-1] * f[0]
while right - left > 1:
mid = (left + right) // 2
ck = sum([max(0, a[i] - mid // f[i]) for i in range(n)])
if ck <= k: right = mid
else: left = mid
print(right)
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort()
f.sort(reverse=True)
left, right = -1, a[-1] * f[0]
while right - left > 1:
mid = (left + right) // 2
ck = 0
for i in range(n): ck += max(0, a[i] - mid // f[i])
if ck <= k: right = mid
else: left = mid
print(right)
| p02883 |
import heapq
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort(reverse=True)
F.sort()
if sum(A) <= K:
print("0")
exit(0)
L = []
for i in range(N):
heapq.heappush(L, (-A[i]*F[i],A[i],F[i]))
for i in range(K):
temp = heapq.heappop(L)
rep = (-(temp[1]-1)*temp[2], (temp[1]-1), temp[2])
heapq.heappush(L, rep)
ans = heapq.heappop(L)
print((-1*ans[0])) | def solve(B,G,x):
sums = 0
for i in range(N):
req = B[i] - x//G[i]
sums += max(0,req)
if sums <= K:
return True
else:
return False
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort(reverse=True)
F.sort()
if sum(A) <= K:
print("0")
exit(0)
L = []
MAX = 0
for i in range(N):
temp = A[i]*F[i]
MAX = max(MAX,temp)
ng = 1
ok = MAX+1
while abs(ng-ok) > 1:
mid = (ok+ng)//2
#print(mid,solve(A,F,mid))
if solve(A,F,mid):
ok = mid
else:
ng = mid
print(ok)
| p02883 |
import sys
import heapq
N,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
flist=list(map(int,input().split()))
alist.sort()
flist.sort(reverse=True)
#print(alist)
#print(flist)
if sum(alist)<=K:
print((0))
sys.exit(0)
hq=[]
for i in range(N):
heapq.heappush(hq,(-alist[i]*flist[i],alist[i],flist[i]))
for i in range(K):
naf,a,f=heapq.heappop(hq)
naf+=f
a-=1
if a>0:
heapq.heappush(hq,(naf,a,f))
if len(hq)==0:
print((0))
else:
naf,a,f=heapq.heappop(hq)
print((-naf)) | import sys
N,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
flist=list(map(int,input().split()))
alist.sort()
flist.sort(reverse=True)
#print(alist)
#print(flist)
def check(m):
cnt=0
for i in range(N):
if alist[i]*flist[i]>m:
cnt+=-(-(alist[i]*flist[i]-m)//flist[i])
#print(m,cnt,K)
if cnt<=K:
return True
else:
return False
if sum(alist)<=K:
print((0))
sys.exit(0)
baseline=0
for i in range(N):
baseline=max(baseline,alist[i]*flist[i])
#print(baseline)
l,r=0,baseline
while l<=r:
mid=(l+r)//2
#print(l,mid,r)
if not check(mid-1) and check(mid):
print(mid)
break
elif not check(mid):
l=mid+1
else:
r=mid-1 | p02883 |
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a = sorted(a)
f = sorted(f,reverse = True)
hq = []
upper_limit = int(1e+12)
lower_limit = int(0)
def is_ok(checking):
cost = 0
for i in range(n):
cost += max(0,math.ceil((a[i]*f[i]-checking)/f[i]))
if cost <= k:
return True
else:
return False
def meguru_bisect(ng, ok):
while (abs(ok-ng)>1):
mid = (ok+ng)//2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
ok = meguru_bisect(-1, 1e+100)
print((int(ok)))
# 初期値の範囲は取りえる値-1～+1とする←範囲内はok,ngどちらもあり得るため | import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a = sorted(a)
f = sorted(f,reverse = True)
hq = []
def is_ok(checking):
cost = 0
for i in range(n):
cost += max(0,math.ceil((a[i]*f[i]-checking)/f[i]))
if cost <= k:
return True
else:
return False
def meguru_bisect(ng, ok):
while (abs(ok-ng)>1):
mid = (ok+ng)//2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
ok = meguru_bisect(-1, 1e+12+1)
print((int(ok)))
# 初期値の範囲は取りえる値-1～+1とする←範囲内はok,ngどちらもあり得るため | p02883 |
import heapq
N, K = list(map(int, input().split()))
A = sorted([int(i) for i in input().split()], reverse=True)
F = sorted([int(i) for i in input().split()])
if sum(A) <= K:
print((0))
exit()
else:
hq = [(-(A[i]*F[i]), A[i], F[i]) for i in range(N)]
heapq.heapify(hq) # リストhqのheap化
for i in range(K):
c, a, f = heapq.heappop(hq) # heap化されたリストhqから最小値を削除＆その最小値を出力
a -= 1
heapq.heappush(hq, (-(a*f), a, f))
c, a, f = heapq.heappop(hq) # heap化されたリストhqから最小値を削除＆その最小値を出力
print((-c))
| N, K = list(map(int, input().split()))
A = sorted([int(i) for i in input().split()])
F = sorted([int(i) for i in input().split()], reverse=True)
if sum(A) <= K:
print((0))
exit()
else:
OK = 10**12
NG = -1
while OK-NG > 1:
mid = (OK+NG)//2
cnt = 0
for i, a in enumerate(A):
cnt += max(0, a-mid//F[i])
if cnt <= K:
OK = mid
else:
NG = mid
print(OK)
| p02883 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse = True)
def calc(x): #全てx以下にするために何回変える必要があるか
tmp = 0
for a, f in zip(A, F):
tmp += max(0, a - (x // f))
return tmp
ng = -1
ok = 10 ** 18
while ok - ng > 1:
mid = (ok + ng) // 2
if calc(mid) <= K:
ok = mid
else:
ng = mid
print (ok) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse = True)
def calc(x): #全てx以下にするために何回変える必要があるか
tmp = 0
for a, f in zip(A, F):
tmp += max(0, a - (x // f))
if tmp > K:
return tmp
return tmp
ng = -1
ok = 10 ** 18
while ok - ng > 1:
mid = (ok + ng) // 2
if calc(mid) <= K:
ok = mid
else:
ng = mid
print (ok) | p02883 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort(reverse=True)
F.sort()
def judge(x):
val = 0
for i in range(N):
val += max(A[i] - x // F[i], 0)
if val > K:
return False
if val <= K:
return True
ub = 10**12
lb = 0
for i in range(150):
x = (ub+lb)/2
if judge(x):
ub = x
else:
lb = x
print((int(x))) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort(reverse=True)
F.sort()
def judge(x):
val = 0
for i in range(N):
val += max(A[i] - x // F[i], 0)
if val > K:
return False
if val <= K:
return True
ub = 10**12
lb = -1
while lb + 1 < ub:
x = (ub+lb)/2
if judge(x):
ub = x
else:
lb = x
print((int(ub)))
| p02883 |
from heapq import heappop, heappush, heapify
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
F = [int(i) for i in input().split()]
A.sort()
F.sort(reverse=True)
H = []
for i in range(N):
H.append((-A[i]*F[i],F[i]))
heapify(H)
while K>0:
K -= 1
x,y = heappop(H)
x = min(0,x+y)
heappush(H,(x,y))
print((-H[0][0])) | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = list(map(int,input().split()))
a.sort()
f.sort(reverse=True)
ng = -1
ok = 10**12
while ok-ng > 1:
mid = (ok+ng)//2
cnt = 0
for i,e in enumerate(a):
cnt += max(0,e-mid//f[i])
if cnt <= k:
ok = mid
else:
ng = mid
print(ok)
| p02883 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = list(map(int,input().split()))
a.sort()
f.sort(reverse=True)
ng = -1
ok = 10**12
while ok-ng > 1:
mid = (ok+ng)//2
cnt = 0
for i,e in enumerate(a):
cnt += max(0,e-mid//f[i])
if cnt <= k:
ok = mid
else:
ng = mid
print(ok)
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
ok = 10**12
ng = -1
while ok-ng>1:
X = (ok+ng)//2
tmp = 0
for i,e in enumerate(A):
tmp += max(e-X//F[i],0)
if tmp<=K:
ok = X
else:
ng = X
print(ok)
| p02883 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
ok = 10**12
ng = -1
while ok-ng>1:
X = (ok+ng)//2
tmp = 0
for i,e in enumerate(A):
tmp += max(e-X//F[i],0)
if tmp<=K:
ok = X
else:
ng = X
print(ok)
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
ok = 10**12
ng = -1
while ok-ng>1:
X = (ok+ng)//2
tmp = 0
for i in range(N):
tmp += max(A[i]-X//F[i],0)
if tmp<=K:
ok = X
else:
ng = X
print(ok)
| p02883 |
import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
N,K=list(map(int,readline().split()))
A=list(map(int,readline().split()))
F=list(map(int,readline().split()))
#print(N,K)
#print("A:",A)
#print(F)
A.sort()
F.sort(reverse=True)
#print("A:",A)
#print("F:",F)
left=-1
right=10**18
#right=10**3
while left+1<right:
mid=(left+right)//2
tmp=[0]*(N)
for i in range(N):
tmp[i]=max(A[i]-mid//F[i],0)
if sum(tmp)<=K:
right=mid
else:
left=mid
#print("mid:",mid,",tmp:",tmp)
#print("left:",left,",mid:",mid,",right:",right)
print(right) | import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
N,K=list(map(int,readline().split()))
A=list(map(int,readline().split()))
F=list(map(int,readline().split()))
#print(N,K)
#print("A:",A)
#print(F)
A.sort()
F.sort(reverse=True)
#print("A:",A)
#print("F:",F)
left=-1
right=10**18
#right=10**3
while left+1<right:
mid=(left+right)//2
tmp=0
for i in range(N):
tmp+=max(A[i]-mid//F[i],0)
if tmp<=K:
right=mid
else:
left=mid
#print("mid:",mid,",tmp:",tmp)
#print("left:",left,",mid:",mid,",right:",right)
print(right) | p02883 |
import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
F=list(map(int,input().split()))
#print(N,K)
#print("A:",A)
#print(F)
A.sort()
F.sort(reverse=True)
#print("A:",A)
#print("F:",F)
left=-1
right=2*10**17
#right=10**3
while left+1<right:
mid=(left+right)//2
tmp=0
for i in range(N):
tmp+=max(A[i]-mid//F[i],0)
if tmp<=K:
right=mid
else:
left=mid
#print("mid:",mid,",tmp:",tmp)
#print("left:",left,",mid:",mid,",right:",right)
print(right) | import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
N,K=list(map(int,readline().split()))
A=list(map(int,readline().split()))
F=list(map(int,readline().split()))
#print(N,K)
#print("A:",A)
#print(F)
A.sort()
F.sort(reverse=True)
#print("A:",A)
#print("F:",F)
left=-1
right=N*A[-1]*F[0]
#right=10**3
while left+1<right:
mid=(left+right)//2
tmp=0
for i in range(N):
tmp+=max(A[i]-mid//F[i],0)
if tmp<=K:
right=mid
else:
left=mid
#print("mid:",mid,",tmp:",tmp)
#print("left:",left,",mid:",mid,",right:",right)
print(right) | p02883 |
import sys
input = sys.stdin.buffer.readline
from heapq import heappush, heappop
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A = sorted(A)
F = sorted(F)[::-1]
h = []
for i in range(N):
a, f = A[i], F[i]
heappush(h, (- a * f, a, f))
while K > 0:
x, y, z = heappop(h)
if x == 0:
break
else:
heappush(h, (- (y - 1) * z, (y - 1), z))
K -= 1
x, y, z = heappop(h)
print((-x)) | import sys
input = sys.stdin.buffer.readline
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A = sorted(A)
F = sorted(F)[::-1]
left = -1
right = 10 ** 18
while left + 1 < right:
mid = (left + right) // 2
tmp = 0
for i in range(N):
a, f = A[i], F[i]
if a * f > mid:
tmp += -(-(a * f - mid) // f)
if tmp <= K:
right = mid
else:
left = mid
print(right) | p02883 |
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
Fs = list(map(int, input().split()))
As.sort()
Fs.sort(reverse=True)
maxAF = max([A*F for A, F in zip(As, Fs)])
def isOK(X):
rest = K
for A, F in zip(As, Fs):
if A*F > X:
A2 = X//F
d = A-A2
if d > rest:
return False
rest -= d
return True
ng, ok = -1, maxAF
while abs(ok-ng) > 1:
mid = (ng+ok) // 2
if isOK(mid):
ok = mid
else:
ng = mid
print(ok)
| def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
Fs = list(map(int, input().split()))
As.sort()
Fs.sort(reverse=True)
def isOK(score):
d = 0
for A, F in zip(As, Fs):
if A*F > score:
d += -(-(A*F-score) // F)
return d <= K
ng, ok = -1, 10**12
while abs(ok-ng) > 1:
mid = (ng+ok) // 2
if isOK(mid):
ok = mid
else:
ng = mid
print(ok)
solve()
| p02883 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
l, r = -1, 10 ** 12
def func(x):
k = 0 # 修行回数初期化
for a, f in zip(A, F): # O(N)
if a <= x // f: # (Ai-Ki)*Fi<=x Ki=0なら次 (a*f<=xの変形)
continue
k += a - x // f
# else (Ai-Ki)*Fi<=x を満たすようにKiを設定。つまり修行回数にKiを加算。
if k <= K:
return 1
return 0
while (r - l > 1): # O(logx)
mid = (l + r) // 2
if func(mid):
r = mid
else:
l = mid
print(r) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
l, r = -1, 10 ** 12
def func(x): # a, x, kは全て整数ということに注意(//またはint())
k = 0 # 修行回数初期化
for a, f in zip(A, F): # O(N)
e = x // f
if a <= e: # (Ai-Ki)*Fi<=x Ki=0なら次 (a*f<=xの変形)
continue
k += a - e
# else (Ai-Ki)*Fi<=x を満たすようにKiを設定。つまり修行回数にKiを加算。
if k <= K:
return 1
return 0
while (r - l > 1): # O(logx)
mid = (l + r) // 2
if func(mid):
r = mid
else:
l = mid
print(r)
| p02883 |
import heapq
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort(reverse=True)
f.sort()
m = []
for i, j in zip(a, f):
heapq.heappush(m, (-i*j, i, j))
for i in range(k):
t = heapq.heappop(m)
heapq.heappush(m, (-(t[1] - 1)*t[2], t[1]-1, t[2]))
if m[0][0]== 0:
print((0))
break
else:
print((-m[0][0]))
| import math
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort(reverse=True)
f.sort()
hi = a[0] * f[-1]
lo = 0
def caneat(m):
t = 0
for i, j in zip(a, f):
if i * j > m:
t += math.ceil((i*j - m)/j)
if t > k:
return False
return True
while hi != lo:
m = (hi + lo) // 2
if caneat(m):
hi = m
else:
lo = m + 1
return hi
print((main()))
| p02883 |
import heapq
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
T = [[- A[i] * F[i], A[i]] for i in range(N)]
heapq.heapify(T)
for _ in range(K):
t, a = heapq.heappop(T)
if t < 0:
heapq.heappush(T, [(t // a) * (a - 1), a - 1])
else:
heapq.heappush(T, [0, 0])
break
print((- heapq.heappop(T)[0]))
| N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
minT, maxT = -1, max([A[i] * F[i] for i in range(N)])
while maxT - minT > 1:
midT = minT + (maxT - minT) // 2
if sum([max(A[i] - midT // F[i], 0) for i in range(N)]) > K:
minT = midT
else:
maxT = midT
print(maxT)
| p02883 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, K, A, F):
A.sort(reverse=True)
F.sort()
cost = [[-a * f, a, f] for a, f in zip(A, F)]
heapq.heapify(cost)
while cost and K > 0:
if len(cost) >= 2:
l1 = heapq.heappop(cost)
l2 = heapq.heappop(cost)
diff = -(l1[0] - l2[0])
r = diff // l1[2]
if r == 0:
r = 1
if K >= r:
K -= r
else:
r = K
K = 0
na = l1[1] - r
l1[0] = -(na * l1[2])
l1[1] = na
if l1[1] != 0:
heapq.heappush(cost, l1)
heapq.heappush(cost, l2)
else:
_, a, f = heapq.heappop(cost)
return max(0, a-K) * f
ans = 0
for c, _, __ in cost:
ans = max(ans, -c)
return ans
def main():
N, K = read_int_n()
A = read_int_n()
F = read_int_n()
print(slv(N, K, A, F))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
@mt
def slv(N, K, A, F):
A.sort(reverse=True)
F.sort()
def possible(c):
k = K
for a, f in zip(A, F):
d = c//f
if d - a < 0:
k += d - a
if k >= 0:
return 1
return 0
b = Bisect(possible)
return b.bisect_left(1, 0, 10**18)
def main():
N, K = read_int_n()
A = read_int_n()
F = read_int_n()
print(slv(N, K, A, F))
if __name__ == '__main__':
main()
| p02883 |
# -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, pow(b, self.m-2, self.m))
def pow(self, a, b):
return pow(a, b, self.m)
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
def f(n):
r = 1
for i in range(1, n+1):
r *= i
return r
@mt
def slv(N, K, A, F):
from heapq import heappop, heappush, heapify
A.sort()
F.sort(reverse=True)
q = []
for a, f in zip(A, F):
q.append((-(a * f), a, f))
heapify(q)
for _ in range(K):
_, a, f = heappop(q)
if a > 0:
a -= 1
heappush(q, (-a*f, a, f))
return -min(q, key=lambda x: x[0])[0]
def main():
N, K = read_int_n()
A = read_int_n()
F = read_int_n()
print(slv(N, K, A, F))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, pow(b, self.m-2, self.m))
def pow(self, a, b):
return pow(a, b, self.m)
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
def f(n):
r = 1
for i in range(1, n+1):
r *= i
return r
@mt
def slv(N, K, A, F):
A.sort()
F.sort(reverse=True)
def f(x):
y = 0
for a, f in zip(A, F):
b = a - x//f
if b > 0:
y += b
if y <= K:
return 1
return 0
return Bisect(f).bisect_left(1, 0, 10**19)
def main():
N, K = read_int_n()
A = read_int_n()
F = read_int_n()
print(slv(N, K, A, F))
if __name__ == '__main__':
main()
| p02883 |
# -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, pow(b, self.m-2, self.m))
def pow(self, a, b):
return pow(a, b, self.m)
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
def f(n):
r = 1
for i in range(1, n+1):
r *= i
return r
@mt
def slv(N, K, A, F):
A.sort()
F.sort(reverse=True)
def f(x):
y = 0
for a, f in zip(A, F):
b = a - x//f
if b > 0:
y += b
if y <= K:
return 1
return 0
return Bisect(f).bisect_left(1, 0, 10**19)
def main():
N, K = read_int_n()
A = read_int_n()
F = read_int_n()
print(slv(N, K, A, F))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, pow(b, self.m-2, self.m))
def pow(self, a, b):
return pow(a, b, self.m)
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
def f(n):
r = 1
for i in range(1, n+1):
r *= i
return r
@mt
def slv(N, K, A, F):
A.sort()
F.sort(reverse=True)
def f(x):
y = 0
for a, f in zip(A, F):
b = a - x//f
if b > 0:
y += b
if y <= K:
return 1
return 0
return Bisect(f).bisect_left(1, 0, 10**18)
def main():
N, K = read_int_n()
A = read_int_n()
F = read_int_n()
print(slv(N, K, A, F))
if __name__ == '__main__':
main()
| p02883 |
def is_ok(x, A, F):
trainings = 0
for i in range(N):
t = A[i] - x // F[i]
if t > 0:
trainings += t
return trainings <= K
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
ng = -1
ok = A[-1] * F[0]
while ok - ng > 1:
m = ng + (ok - ng) // 2
if is_ok(m, A, F):
ok = m
else:
ng = m
print(ok)
| def is_ok(x):
trainings = 0
for i in range(N):
t = A[i] - x // F[i]
if t > 0:
trainings += t
return trainings <= K
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
ng = -1
ok = A[-1] * F[0]
while ok - ng > 1:
m = ng + (ok - ng) // 2
if is_ok(m):
ok = m
else:
ng = m
print(ok)
| p02883 |
import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a=sorted(a)
f=list(map(int,input().split()))
f=sorted(f,reverse=True)
s=sum(a)
if k>=s:
print((0))
exit()
def is_ok(b):
m=0
for p,q in zip(a,f):
if p>b//q:
m+=p-(b//q)
if m>k:
return False
return True
ok=10**12+1
ng=0
while ok-ng>1:
m=(ok+ng)//2
if is_ok(m):
ok=m
else:
ng=m
print(ok)
| import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a=sorted(a)
f=list(map(int,input().split()))
f=sorted(f,reverse=True)
def is_ok(b):
m=0
for p,q in zip(a,f):
if p>b//q:
m+=p-(b//q)
if m>k:
return False
return True
ok=10**12+1
ng=-1
while ok-ng>1:
m=(ok+ng)//2
if is_ok(m):
ok=m
else:
ng=m
print(ok)
| p02883 |
from heapq import *
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
F = list(map(int, input().split()))
F.sort(reverse=True)
data = []
for a, f in zip(A, F):
heappush(data, (-a*f, a, f))
for _ in range(K):
x, a, f = heappop(data)
if a > 0:
a -= 1
heappush(data, (-a*f, a, f))
print((-heappop(data)[0])) | import sys
input = sys.stdin.readline
def binary_search_int(ok, ng, test):
"""
:param ok: solve(x) = True を必ず満たす点
:param ng: solve(x) = False を必ず満たす点
"""
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ok
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
F = list(map(int, input().split()))
F.sort(reverse=True)
def max2(x,y):
return x if x > y else y
def test(x):
temp = K
for a, f in zip(A, F):
temp -= max2((a - x//f), 0)
if temp < 0:
return False
return True
print((binary_search_int(A[-1]**2 + 100, -1,test)))
| p02883 |
import heapq
N, K = [int(x) for x in input().split()]
A = sorted([int(x) for x in input().split()])
F = sorted([int(x) for x in input().split()], reverse=True)
h = []
if (sum(A) <= K):
print((0))
else:
for a, f in zip(A, F):
heapq.heappush(h, (-a*f, [a, f]))
for i in range(K):
before = heapq.heappop(h)
a, f = before[1]
heapq.heappush(h, (-(a-1)*f, [a-1, f]))
print((-1 * heapq.heappop(h)[0]))
| N, K = [int(x) for x in input().split()]
A = sorted([int(x) for x in input().split()])
F = sorted([int(x) for x in input().split()], reverse=True)
lb = 0
ub = 10 ** 12
def isPossible(M):
cnt = 0
# a = 4 , f = 5 のとき a*f = 20
# M = 30 => そのままでOK
# M = 9 => (20-9+4)//5
for a, f in zip(A, F):
if (M >= a*f): continue
cnt += (a*f - M + (f-1)) // f
return cnt <= K
for i in range(100):
mid = (lb + ub) // 2
if (isPossible(mid)):
ub = mid
else:
lb = mid
print(ub)
| p02883 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse = True)
import heapq
pop = heapq.heappop
push = heapq.heappush
q = []
for i in range(N):
push(q, [- A[i] * F[i], A[i], F[i]])
for i in range(K):
x, y, z = pop(q)
if y == 0:
print((0))
exit()
push(q, [- (y - 1) * z, y - 1, z])
t = pop(q)
print((-t[0])) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse = True)
M = 0
for i in range(N):
M += A[i] * F[i]
def nasu(n):
ans = 0
for i in range(N):
ans += max(0, A[i] - (n // F[i]))
if ans <= K:
return True
else:
return False
def hersCode():
ok = M
ng = -1
while abs(ok - ng) > 1:
mid = abs(ok + ng) // 2
if nasu(mid):
ok = mid
else:
ng = mid
return ok
print((hersCode()))
| p02883 |
n,k=list(map(int,input().split()))
a=list(map(int, input().split()))
f=list(map(int, input().split()))
a.sort()
f.sort(reverse=True)
maxaf=a[0]*f[0]
for i in range(n):
if a[i]*f[i]>maxaf:
maxaf=a[i]*f[i]
def solve(x):
total=0
for i in range(n):
total+=max(0,a[i]-x//f[i])
return total<=k
#xの範囲 ngは実現が難しい方
ok=maxaf
ng=-1
while ok-ng>1:
mid=(ok+ng)//2
if solve(mid):
ok=mid
else:
ng=mid
print(ok) | n,k=list(map(int,input().split()))
a=list(map(int, input().split()))
f=list(map(int, input().split()))
a.sort()
f.sort(reverse=True)
maxaf=a[0]*f[0]
for i in range(n):
if a[i]*f[i]>maxaf:
maxaf=a[i]*f[i]
def solve(x):
total=0
for i in range(n):
total+=max(0,a[i]-x//f[i]) #負になりうる懸念ができていなかった、とほほ
return total<=k
#xの範囲 ngは実現が難しい方
ok=maxaf
ng=-1
while ok-ng>1:
mid=(ok+ng)//2
if solve(mid):
ok=mid
else:
ng=mid
print(ok) | p02883 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
f = list(map(int, input().split()))
a.sort()
f.sort()
f = f[::-1]
import heapq
af = []
heapq.heapify(af)
for i in range(len(a)):
heapq.heappush(af, [a[i] * f[i] * -1, f[i]])
for i in range(k):
tmp = heapq.heappop(af)
tmp[0] = (tmp[0] // tmp[1] + 1) * tmp[1]
heapq.heappush(af, tmp)
print((max(heapq.heappop(af)[0] * -1, 0)))
| n, k = list(map(int, input().split()))
aa = list(map(int, input().split()))
ff = list(map(int, input().split()))
a = sorted(aa, reverse=True)
f = sorted(ff)
def C(x):
ret = 0
for i in range(n):
ret += max(0, a[i] - x // f[i])
return ret
lb = -1
ub = 10 ** 12 + 1
while (ub - lb) > 1:
mid = (ub + lb) // 2
if C(mid) > k:
lb = mid
else:
ub = mid
print(ub)
| p02883 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
start = -1
end = A[-1] * F[0]
def check(now):
cnt = 0
for i in range(N):
if A[i] * F[i] > now:
cnt += (A[i]*F[i] - now + F[i] - 1) // F[i]
if cnt > K:
return False
return True
while end > start + 1:
now = (start + end) // 2
if check(now):
end = now
else:
start = now
print(end)
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
F = list(map(int, input().split()))
A.sort()
F.sort(reverse=True)
start = -1
end = A[-1] * F[0]
def check(now):
cnt = 0
for a, f in zip(A, F):
eatable = now//f
if eatable < a:
cnt += a - eatable
if cnt > K:
return False
return True
while end > start + 1:
now = (start + end) // 2
if check(now):
end = now
else:
start = now
print(end)
| p02883 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
F=list(map(int,input().split()))
A.sort()
F.sort(reverse=True)
def condition(num):
count=0
goal=[num//F[i] for i in range(N)]
for i in range(0,N):
if A[i]>goal[i]:
count+=A[i]-goal[i]
return K>=count
start=0
end=10**20
while end-start>1:
test=(end+start)//2
if condition(test):
end=test
else:
start=test
if condition(start):
print(start)
else:
print(end) | import sys
input=sys.stdin.readline
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
F=list(map(int,input().split()))
A.sort()
F.sort(reverse=True)
def condition(num):
count=0
goal=[num//F[i] for i in range(N)]
for i in range(0,N):
if A[i]>goal[i]:
count+=A[i]-goal[i]
return K>=count
start=0
end=2*(10**17)
while end-start>1:
test=(end+start)//2
if condition(test):
end=test
else:
start=test
if condition(start):
print(start)
else:
print(end) | p02883 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
def meguru_bisect(is_ok, left, right):
"""
:param is_ok: 定義して下さい
:param left: 取りうる最小の値-1
:param right: 取りうる最大の値+1
:return: is_okを満たす最小(もしくは最大)の値
"""
while abs(left - right) > 1:
mid = (left + right) // 2
if is_ok(mid):
right = mid
else:
left = mid
return right
def is_ok(x):
total = 0
for i in range(n):
total += max(0, A[i] - x // F[i])
return total <= k
n, k = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
left = -1
right = 10 ** 12 + 1
res = meguru_bisect(is_ok, left, right)
print(res)
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
def meguru_bisect(left, right):
"""
is_okを定義して下さい
:param left: 取りうる最小の値-1
:param right: 取りうる最大の値+1
:return: is_okを満たす最小(もしくは最大)の値
"""
while abs(left - right) > 1:
mid = (left + right) // 2
if is_ok(mid):
right = mid
else:
left = mid
return right
def is_ok(x):
total = 0
for i in range(n):
total += max(0, A[i] - x // F[i])
return total <= k
n, k = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
F = sorted(list(map(int, input().split())), reverse=True)
left = -1
right = 10 ** 12 + 1
res = meguru_bisect(left, right)
print(res)
if __name__ == '__main__':
resolve()
| p02883 |
import math
#成績xを取れるか？xに関して二分探索
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
F = list(map(int,input().split()))
#Aを小さい順，Fを大きい順に並べれば対応する．
A.sort()
F.sort(reverse =True)
AF=[0]*N
for i in range(N):
AF[i]=A[i]*F[i]
ng=-1
ok=10**12+1
#二分探索，成績xをとるのにi番目の人が何回修行すべきか，これがK以下なら良い
while ok-ng!=1:
x = (ok+ng)//2
num_tra =0
for i in range(N):
af_i = int(math.ceil((AF[i]-x)/F[i]))
if af_i>0:
num_tra+=af_i
if num_tra<=K:
ok=x
else:
ng=x
print(ok) | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
"""
コストが低い人が食べにくいものを食べる．
コストが低い人を追い抜かすことはない，（追い抜かすなら入れ替えて良いから）
"""
def main():
mod=10**9+7
N,K=MI()
A=LI()
F=LI()
F.sort()
A.sort(reverse=True)
if K>=sum(A):
print((0))
exit()
def ch(x):
# x秒でクリアできるか
temp=0# 必要修行回数
for i in range(N):
af=A[i]*F[i]
if af>x:
add=(af-x+F[i]-1)//F[i]
temp+=(add)
return temp <= K
ok=10**12
ng=0
while ok-ng>1:
med=(ok+ng)//2
if ch(med):
ok=med
else:
ng=med
print(ok)
main()
| p02883 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, atan2, degrees
from operator import mul
from functools import reduce
sys.setrecursionlimit(10**8)
INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007
n, k = LI()
A = sorted(LI())
F = sorted(LI(), reverse=True)
que = [(-A[i] * F[i], -F[i], A[i]) for i in range(n)]
heapify(que)
while k and que:
x, f, a = heappop(que)
if a:
a -= 1
x -= f
heappush(que, (x, f, a))
k -= 1
if que:
print((-que[0][0]))
else:
print((0))
| from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, atan2, degrees
from operator import mul
from functools import reduce
sys.setrecursionlimit(10**8)
INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007
n, k = LI()
A = sorted(LI())
F = sorted(LI(), reverse=True)
ok = A[-1] * F[0]
ng = -1
while ok > ng + 1:
mid = (ok + ng) // 2
ret = 0
for i in range(n):
if A[i] * F[i] > mid:
ret += (A[i] * F[i] - mid) // F[i] + bool((A[i] * F[i] - mid) % F[i])
if ret > k:
ng = mid
else:
ok = mid
print(ok) | p02883 |
import heapq
N,K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
F = [int(f) for f in input().split()]
if K >= sum(A):
ans = 0
else:
A.sort(reverse=True)
F.sort()
h = []
for i in range(N):
heapq.heappush(h, [-A[i]*F[i], A[i], F[i]])
while K > 0:
temp = heapq.heappop(h)
temp[0] += temp[2]
temp[1] -= 1
heapq.heappush(h, temp)
K -= 1
L = heapq.heappop(h)
ans = -L[0]
print(ans) | N,K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
F = [int(f) for f in input().split()]
A.sort()
F.sort(reverse=True)
if K >= sum(A):
ans = 0
else:
u = 10**13
l = 0
while u-l > 1:
x = (u+l)//2
cnt = K
for i in range(N):
cnt -= max(0, A[i]-x//F[i])
if cnt >= 0:
u = x
else:
l = x
cnt = K
for i in range(N):
cnt -= max(0, A[i]-l//F[i])
if cnt >= 0:
ans = l
else:
ans = u
print(ans) | p02883 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
cnt=[]
a.sort()
f.sort(reverse=True)
for i in range(n):
cv=a[i]*f[i]
cnt.append(cv)
def judge(s):
tmp=k
for i in range(n):
if cnt[i]>s:
if (cnt[i]-s)%f[i]==0:
vv=(cnt[i]-s)//f[i]
else:
vv=1+(cnt[i]-s)//f[i]
tmp-=vv
if tmp<0:
return False
return True
left=-1
right=10**18
while left+1<right:
mid=(left+right)//2
if judge(mid):
right=mid
else:
left=mid
print(right) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
cnt=[0]*n
a.sort()
f.sort(reverse=True)
for i in range(n):
cnt[i]=a[i]*f[i]
def judge(s):
tmp=k
for i in range(n):
if cnt[i]>s:
if (cnt[i]-s)%f[i]==0:
vv=(cnt[i]-s)//f[i]
else:
vv=1+(cnt[i]-s)//f[i]
tmp-=vv
if tmp<0:
return False
return True
left=-1
right=10**18
while left+1<right:
mid=(left+right)//2
if judge(mid):
right=mid
else:
left=mid
print(right) | p02883 |
N,K = list(map(int, input().strip().split(' ')))
A = sorted(list(map(int, input().strip().split(' '))), reverse=True)
F = sorted(list(map(int, input().strip().split(' '))))
if sum(A) <= K:
print((0))
exit()
ng = 0
ok = max([a*f for a,f in zip(A,F)])
while True:
if ok-ng < 2: break
k = int((ng+ok)/2)
now_cost = 0
for a,f in zip(A,F):
while a*f > k:
a -= 1
now_cost += 1
if now_cost > K: break
if now_cost > K:
ng = k
else:
ok = k
print(ok)
| N,K = list(map(int, input().strip().split(' ')))
A = sorted(list(map(int, input().strip().split(' '))), reverse=True)
F = sorted(list(map(int, input().strip().split(' '))))
if sum(A) <= K:
print((0))
exit()
ng = 0
ok = max([a*f for a,f in zip(A,F)])
while True:
if ok-ng == 1: break
m = int((ng+ok)/2)
now_cost = 0
for a,f in zip(A,F):
now_cost += max(a-(m//f), 0)
if now_cost <= K:
ok = m
else:
ng = m
print(ok) | p02883 |
#E
import math
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort(reverse=True)
F.sort()
left = 0
right = 10**12
while True:
mid = (left+right)//2
if right - left <= 1:
count = 0
for i in range(N):
a = left//F[i]
count+=max(0,A[i]-a)
if count <= K:
ans = left
else:
ans = right
break
count = 0
for i in range(N):
a = mid//F[i]
count+=max(0,A[i]-a)
#print(right,left,count)
if count <= K:
right = mid
else:
left = mid
print(ans)
| #E
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort(reverse=True)
F.sort()
left = 0
right = 10**12
while True:
mid = (left+right)//2
if right - left <= 1:
count = 0
for i in range(N):
a = left//F[i]
count+=max(0,A[i]-a)
if count <= K:
ans = left
else:
ans = right
break
count = 0
for i in range(N):
a = mid//F[i]
count+=max(0,A[i]-a)
if count <= K:
right = mid
else:
left = mid
print(ans)
| p02883 |
from math import ceil
n, k = list(map(int, input().split()))
A = sorted(map(int, input().split()))
F = sorted(map(int, input().split()))
A.reverse()
ok = max(a * f for a, f in zip(A, F))
ng = -1
while ok - ng != 1:
x = (ok + ng) // 2
cnt = 0
for a, f in zip(A, F):
if a * f > x:
cnt += ceil(a - x / f)
if cnt > k:
ng = x
break
else:
ok = x
print(ok)
| def main():
from math import ceil
n, k = list(map(int, input().split()))
A = sorted(map(int, input().split()))
F = sorted(map(int, input().split()))
A.reverse()
ok = max(a * f for a, f in zip(A, F))
ng = -1
while ok - ng != 1:
x = (ok + ng) // 2
cnt = 0
for a, f in zip(A, F):
if a * f > x:
cnt += ceil(a - x / f)
if cnt > k:
ng = x
break
else:
ok = x
print(ok)
if __name__ == "__main__":
main() | p02883 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a=sorted(a)
f=sorted(f,reverse=True)
def is_lessthanK(X):
ans=0
for i in range(n):
ans+=max(0,a[i]-X//f[i])
if ans > k:
return False
return True
ng=-1
ok=10**13
while ok-ng>1:
mid=(ok+ng)//2
if is_lessthanK(mid):
ok=mid
else:
ng=mid
print(ok)
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a=sorted(a)
f=sorted(f,reverse=True)
def is_lessthanK(X):
ans=0
for A,F in zip(a,f):
if A*F>X:
ans+=A-X//F
if ans > k:
return False
return True
ng=-1
ok=a[-1]*f[0]
while ok-ng>1:
mid=(ok+ng)//2
if is_lessthanK(mid):
ok=mid
else:
ng=mid
print(ok)
| p02883 |
import sys
from collections import Counter, deque, defaultdict
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
n, k = MAP()
a = LIST()
f = LIST()
a = sorted(a, reverse = True)
f = sorted(f)
heap = []
heapq.heapify(heap)
for i in range(n):
heapq.heappush(heap, (-1*f[i]*a[i], f[i]))
for i in range(k):
if len(heap) > 0:
dot, ff = heapq.heappop(heap)
dot += ff
if dot != 0:
heapq.heappush(heap, (dot, ff))
if len(heap) > 0:
print((heapq.heappop(heap)[0] * -1))
else:
print((0)) | import sys
from collections import Counter, deque, defaultdict
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
n, k = MAP()
a = LIST()
f = LIST()
a = sorted(a, reverse = True)
f = sorted(f)
def ok(x):
res = 0
for i in range(n):
res += max(a[i] - x//f[i], 0)
return res <= k
l = -1
r = INF
while l+1 < r:
mid = (l+r)//2
if ok(mid):
r = mid
else:
l = mid
print(r) | p02883 |
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = list(map(int,input().split()))
a.sort(reverse=True)
f.sort()
z = list(zip(a,f))
ok = max(x*y for x,y in z)
ng = -1
while ok-ng>1:
mid = (ok+ng)//2
if sum(x-mid//y for x,y in z if x*y > mid) <= k:
ok = mid
else:
ng = mid
print(ok) | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
f = list(map(int,input().split()))
a.sort(reverse=True)
f.sort()
z = list(zip(a,f))
ok = max(x*y for x,y in z)
ng = -1
while ok-ng>1:
mid = (ok+ng)//2
if sum(x-mid//y for x,y in z if x*y > mid) <= k:
ok = mid
else:
ng = mid
print(ok) | p02883 |
N, K = list(map(int, input().split()))
As = sorted(list(map(int, input().split())))
Fs = sorted(list(map(int, input().split())),reverse=True)
Xs = sorted([(a*f,i) for i,(a,f) in enumerate(zip(As,Fs))],reverse=True)
# Xs =[a*f for a,f in zip(As,Fs)]
# print(Xs)
# print(As)
# print(Fs)
import heapq
q = []
INF = 10**6
heapq.heapify(q)
for i,(a,f) in enumerate(zip(As,Fs)):
num = -(a*f*INF+i)
heapq.heappush(q,num)
if K >= sum(As):
print((0))
exit()
for k in range(K):
num = heapq.heappop(q)
i = (-num)%INF
n = (-num)//INF
# print(i,n,As[i],Fs[i])
As[i] -= 1
upd = -(As[i]*Fs[i]*INF+i)
heapq.heappush(q,upd)
num = heapq.heappop(q)
ans = (-num)//INF
print(ans)
# x_min = min(Xs)
# ns = [max(0,A-x_min//F) for A,F in zip(As,Fs)]
# print(ns)
| N, K = list(map(int, input().split()))
As = sorted(list(map(int, input().split())))
Fs = sorted(list(map(int, input().split())),reverse=True)
Xs = [a*f for a,f in zip(As,Fs)]
X_M = max(Xs)
def f(x):
K_tmp = sum([max(0,a-x//f) for a,f in zip(As,Fs)])
return K_tmp <= K
def binarySearch(l,r,target):
while r - l > 1:
mid = (l+r)//2
"""計算を入れる"""
# print(mid, guess)
if f(mid):
r = mid
else:
l = mid
return r
print((binarySearch(-1,X_M,K))) | p02883 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.