# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1195550 | jesusarg | Self Study (JOI22_ho_t2) | Pypy 3 | 279 ms | 143312 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)
컴파일 시 표준 출력 (stdout) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |