2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest J dp

Bottles

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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

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 xseconds 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.

Input

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

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is the amount of soda remaining in the i-th bottle.

The third line contains n positive integers b1, b2, ..., bn (1 ≤ bi ≤ 100), where bi is the volume of the i-th bottle.

It is guaranteed that ai ≤ bi for any i.

Output

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.

Examples

input

4
3 3 4 3
4 7 6 5

output

2 6

input

2
1 1
100 100

output

1 1

input

5
10 30 5 6 24
10 41 7 8 24

output

3 11

Note

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 = 6seconds to do it.

题意：给你n个瓶子，每个瓶子的水量和容量，然后对这些水进行操作，使得在占用瓶子最少的情况下，倒出的水最少。

题解：定义dp[i][j][k]为前i个瓶子选了j个容量为k，所以当前答案就是总水量减去j个瓶子的水量，这就转化为一个背包问题，从前i个瓶子选出j个，在容量不小于tot的情况下水的总量最多。

dp[i][j][k]=max(dp[i-1][j][k],dp[i-1][j-1][k-b[i]]+a[i]).

可以用滚动数组优化。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
int a[105],b[105],dp[105][10005],sum[105];
int main(){
	int n,i,j,k,tot=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d",&a[i]);
		tot+=a[i];
	}
	for(i=1;i<=n;i++){
		scanf("%d",&b[i]);
		sum[i]=sum[i-1]+b[i];
	}
	int s=inf,t=inf;
	for(i=0;i<=n;i++){
		for(j=0;j<=sum[n];j++){
			dp[i][j]=-inf;
		}
	}
	dp[0][0]=0;
	for(i=1;i<=n;i++){
		for(j=i;j>=1;j--){
			for(k=sum[i];k>=b[i];k--){
				dp[j][k]=max(dp[j][k],dp[j-1][k-b[i]]+a[i]);
				if(tot<=k&&dp[j][k]>=0){
					if(j<s){
						s=j;
						t=tot-dp[j][k];
					}
					else if(j==s){
						t=min(t,tot-dp[j][k]);
					}
				}
			}
		}
	}
	printf("%d %d\n",s,t);
	return 0;
}