Submission #1195550

#TimeUsernameProblemLanguageResultExecution timeMemory
1195550jesusargSelf Study (JOI22_ho_t2)Pypy 3
54 / 100
279 ms143312 KiB
import sys
n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split()))
lo=0
hi=max(a)*m
while lo <= hi:
    mid=(lo+hi)>>1
    need=0
    for i in range(n):
        need+=(mid+a[i])//a[i]
        if need>n*m:
            break
    if need <= n*m:
        lo = mid+1
    else:
        hi = mid-1

print(lo)

Compilation message (stdout)

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 29%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...