口胡一个暴力，然后寄了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<ctime>
#include<complex>
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int N=101;
int n,m,b[N],sum,ans,f[N][N][N*N];
struct point{
	int x,y;
}a[N];
int cmp(point a,point b){
	return a.y>b.y;
}
int main()
{
	n=read();
	for(int i=1;i<=n;i++){
		a[i].x=read();
		sum+=a[i].x;
	}
	for(int i=1;i<=n;i++)
		a[i].y=read();
	sort(a+1,a+n+1,cmp);
	int res=0;
	for(int i=1;i<=n;i++){
		res+=a[i].y;
		m++;
		if(res>=sum)
			break;
	}
	for(int i=1;i<=n;i++)
		b[i]=b[i-1]+a[i].y;
	printf("%d ",m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			for(int k=0;k<=b[j];k++){
				if(k<a[i].y)
					f[i][j][k]=f[i-1][j][k];
				else f[i][j][k]=max(f[i-1][j][k],f[i-1][j-1][k-a[i].y]+a[i].x);	
			}
	for(int i=sum;i<=b[n];i++)
		ans=max(ans,f[n][m][i]);
	printf("%d",sum-ans);
	return 0;
}