n = int(input())
huowu = list(map(int, input().split(' ')))
rongliang = list(map(int, input().split(' ')))
len_rongliang = len(rongliang)

sum_huowu = sum(huowu)

temp = []
min_nums = [99999999]
min_index = []
def digui(start_index, cur_rong):
    if cur_rong >= sum_huowu:
        if min_nums[0] > len(temp):
            min_nums[0] = len(temp)
            min_index[:] = temp[:]
        return

    for i in range(start_index, len_rongliang):
        temp.append(i)
        digui(i + 1, cur_rong + rongliang[i])
        temp.pop()

digui(0, 0)
yiyou = 0
for index in min_index:
    yiyou += huowu[index]
print(min_nums[0], sum_huowu-yiyou)

是这个吗😂