CF730J.Bottles

Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda a__i and bottle volume b__i (a__i ≤ b__i).

Nick has decided to pour all remaining soda into minimal number of bottles, moreover he has to do it as soon as possible. Nick spends x seconds to pour x units of soda from one bottle to another.

Nick asks you to help him to determine k — the minimal number of bottles to store all remaining soda and t — the minimal time to pour soda into k bottles. A bottle can't store more soda than its volume. All remaining soda should be saved.

尼克生日后还剩下 $n$ 瓶汽水。每瓶汽水由两个值描述：剩余汽水量 $a_i$ 和瓶子容积 $b_i$（满足 $a_i \leq b_i$）。

尼克决定将所有剩余汽水倒入尽可能少的瓶子中，且要求尽快完成这一操作。尼克将 $x$ 单位汽水从一个瓶子倒入另一个瓶子需要 $x$ 秒。

尼克请你帮他确定：

• $k$ —— 能容纳全部剩余汽水的最少瓶子数量；
• $t$ —— 将所有汽水倒入 $k$ 个瓶子所需的最短时间。

注意：任一瓶子所盛汽水量不能超过其容积 $b_i$，且所有剩余汽水都必须被保存。

The first line contains positive integer n (1 ≤ n ≤ 100) — the number of bottles.

The second line contains n positive integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 100), where a__i is the amount of soda remaining in the i-th bottle.

The third line contains n positive integers _b_1, _b_2, ..., b__n (1 ≤ b__i ≤ 100), where b__i is the volume of the i-th bottle.

It is guaranteed that a__i ≤ b__i for any i.

第一行包含一个正整数 $n$（$1 \leq n \leq 100$）—— 瓶子的数量。

第二行包含 $n$ 个正整数 $a_1,\,a_2,\,...,\,a_n$（$1 \leq a_i \leq 100$），其中 $a_i$ 表示第 $i$ 个瓶子中剩余的汽水量。

第三行包含 $n$ 个正整数 $b_1,\,b_2,\,...,\,b_n$（$1 \leq b_i \leq 100$），其中 $b_i$ 表示第 $i$ 个瓶子的容积。

保证对任意 $i$，均有 $a_i \leq b_i$。

The only line should contain two integers k and t, where k is the minimal number of bottles that can store all the soda and t is the minimal time to pour the soda into k bottles.

唯一的一行应包含两个整数 $k$ 和 $t$，其中 $k$ 是能够储存所有汽水的最少瓶子数量，$t$ 是将汽水倒入 $k$ 个瓶子所需的最少时间。

In the first example Nick can pour soda from the first bottle to the second bottle. It will take 3 seconds. After it the second bottle will contain 3 + 3 = 6 units of soda. Then he can pour soda from the fourth bottle to the second bottle and to the third bottle: one unit to the second and two units to the third. It will take 1 + 2 = 3 seconds. So, all the soda will be in two bottles and he will spend 3 + 3 = 6 seconds to do it.

在第一个例子中，尼克可以将第一瓶中的汽水倒入第二瓶，耗时 3 秒。此后，第二瓶将含有 $3 + 3 = 6$ 单位汽水。接着，他可将第四瓶中的汽水分别倒入第二瓶和第三瓶：向第二瓶倒 1 单位，向第三瓶倒 2 单位，耗时 $1 + 2 = 3$ 秒。因此，所有汽水最终将集中于两瓶之中，总耗时为 $3 + 3 = 6$ 秒。