样例过不了 调好关

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
long long n, m, dp[N], a[N], b[N], c[N], q;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	int s = 0;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	for (int i = 1; i <= n; i ++) 
	{
		cin >> b[i];
		q += a[i] * b[i];
	}
	for (int i = 1; i <= n; i ++)
	{
		int p = 1, t = 1;
		while (t <= a[i])
		{
			s ++;
			c[s] = p * b[i];
			p *= 2;
			t += p;	
		}
		if (t - p < a[i])
		{
			s ++;
			c[s] = (a[i] - t + p) * b[i];
		}
	}
	dp[0] = 1;
	for (int i = 1; i <= s; i ++)
	{
		for (int j = q; j >= 0; j --)
		{
			dp[j] = min(dp[j], dp[j - c[i]] * c[i]);
		}
	}
	long long ans = 0;
	while (ans <= q && dp[ans] < m) ans ++;
	cout << ans << '\n';
	return 0;
}