Problem: Takahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The _consumption coefficient_ of Member i is A_i.  In the contest, N foods numbered 1 through N will be presented, and the _difficulty_ of Food i is F_i. The details of the contest are as follows:    * A team should assign one member to each food, and should not assign the same member to multiple foods.   * It will take x \times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.   * The score of a team is the longest time it takes for an individual member to finish the food.  Before the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.  What is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?

Submission attempts (in order):
import numpy as np
N, K= map(int, input().split())
A=[int(i) for i in input().split()]
F=[int(i) for i in input().split()]

A=np.array(sorted(A, reverse=True))
F=np.array(sorted(F))

lower_bound=0
upper_bound=np.max(A*F)
K_tmp=0

while upper_bound-lower_bound>1:
    mid=(lower_bound+upper_bound)//2
    K_tmp=np.sum(np.maximum(A-mid//F, 0))
    if K_tmp<K and upper_bound>mid:
        upper_bound=mid
    elif K_tmp>K and lower_bound<mid:
        lower_bound=mid
    elif K_tmp==K:
        upper_bound=mid
        lower_bound=mid
    else: 
        mid=upper_bound
        break

print(mid)

import numpy as np
N, K= map(int, input().split())
A=[int(i) for i in input().split()]
F=[int(i) for i in input().split()]

A=np.array(sorted(A, reverse=True))
F=np.array(sorted(F))

lower_bound=-1
upper_bound=np.max(A*F)+1
K_tmp=0

while upper_bound-lower_bound>0:
    mid=(lower_bound+upper_bound)//2
    K_tmp=np.sum(np.maximum(A-mid//F, 0))
    if K_tmp<K and lower_bound!=mid:
        upper_bound=mid
    elif K_tmp>K and lower_bound!=mid:
        lower_bound=mid
    elif K_tmp==K:
        upper_bound=mid
        lower_bound=mid
    elif lower_bound==mid: 
        mid=upper_bound

print(mid)

import numpy as np
N, K= map(int, input().split())
A=[int(i) for i in input().split()]
F=[int(i) for i in input().split()]

A=np.array(sorted(A, reverse=True))
F=np.array(sorted(F))

lower_bound=0
upper_bound=np.max(A*F)
K_tmp=0

while upper_bound-lower_bound>0:
    mid=(lower_bound+upper_bound)//2
    K_tmp=np.sum(np.maximum(A-mid//F, 0))
    if K_tmp<K:
        upper_bound=mid
    elif K_tmp>K:
        lower_bound=mid
    elif K_tmp==K:
        break

print(mid)

import numpy as np
N, K= map(int, input().split())
A=[int(i) for i in input().split()]
F=[int(i) for i in input().split()]

A=np.array(sorted(A, reverse=True))
F=np.array(sorted(F))

lower_bound=0
upper_bound=np.max(A*F)
K_tmp=0

while upper_bound>=lower_bound:
    mid=(lower_bound+upper_bound)//2
    K_tmp=np.sum(np.maximum(A-mid//F, 0))
    if K_tmp<=K:
        upper_bound=mid-1
    else:
        lower_bound=mid+1

print(lower_bound)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted