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)
... | 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[... | 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)
... | 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:
... | 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 = mi... | 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... | 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... | 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)
... | 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... | 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)
... | 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(ar... | 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)... | 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... | 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 = (... | 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))
# 横に分割する場合
... | 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 ... | 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,... | 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)... | 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
eli... | 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 = ... | 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=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... | # 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 = ma... | 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... | 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()]
de... | # 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.stdi... | 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.stdi... | 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) f... | 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:
an... | 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)
an... | 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())
... | 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... | 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__':
... | 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... | 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 ... | 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... | 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]
... | 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, k... | 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):
... | 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
... | """
AtCoder Beginner Contest 144 E - Gluttony
愚直解
・修行の順序は結果に影響しないから、修行を誰に割り振るか：N^K
・メンバーN人をどの問題に当てるか（N人の並べ方）：N!
-> N^K * N!
間に合わない。
完食にかかる時間のうち最大値がチーム全体の成績なので、
・消化コストAiを修行で下げる
・消化コストAiの大きい人に、食べにくさFiの小さい食べ物を割り当てる
のが良さそう
最大値の最小化、なので、二分探索が使えそうな気もする。
A,F <= 10^6
かかる時間を X 以下にできるか、を考える。
・消化コストが大きい... | 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[... | 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(... | 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
... | 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:
... | 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:
... | 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]... | 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]... | 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]... | 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:
... | 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
... | 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)
mint... | 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)
mint... | 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
w... | 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分探索... | 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... | 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 bina... | 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... | 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:
... | 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 =... | 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 = [... | 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):
... | 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:
... | 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 n... | 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.appe... | 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.appe... | 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:... | 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()))
... | #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())
... | 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=heapp... | 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=... | 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=... | 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:... | 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()... | 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 + ... | 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:
... | 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
... | 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()... | 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()... | 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... | # 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... | 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
... | 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... | 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: righ... | 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 <= ... | 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(... | 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)... | 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... | 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])
... | 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,m... | 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 ... | 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... | 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... | 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... | 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
r... | 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:
... | 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:
re... | 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)
... | 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... | 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... | 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
p... | 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
p... | 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
prin... | 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)
#... | 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)
#... | 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:... | 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)
#... | 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)... | 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):
... | 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... | 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-sco... | 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の変形)
cont... | 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: #... | 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]... | 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:
... | 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... | 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)... | 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, produc... | # -*- 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, produc... | 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().spli... | # -*- 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().spli... | 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().spli... | # -*- 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().spli... | 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)
... | 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 =... | 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-... | 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:
retur... | 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
... | 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
... | 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):
be... | 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):
... | 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... | 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
... | 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の範... | 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]) #負になりうる懸念ができていなかった、とほほ
... | 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)
... | 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... | 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[... | 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 - eatabl... | 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
... | 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]:
... | 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を満たす最小(も... | 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を満たす最小(もしくは最大)の値
... | 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番目の人が何回修行すべきか，こ... | 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=L... | 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, ... | 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, ... | 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 >... | 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 ... | 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:
... | 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=(c... | 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)... | 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... | 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 = l... | #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]
... | 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:
... | 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
... | 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:
... | 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 ... | 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()))
... | 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()))
... | 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... | 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 = m... | 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 ... | 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):
... | p02883 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.