【题解】LuoGu5365：[SNOI2017]英雄联盟

原题传送门
换一种思路，不妨dp固定花费能得到的最多的搭配方式
直接01背包
转移：$d{p}_l=max(d{p}_l,d{p}_{l-j\ast c_i}\ast j)$

Code：

#include <bits/stdc++.h>
#define maxn 1000010
#define LL long long
using namespace std;
LL n, m, k[maxn], c[maxn], dp[maxn], s;

inline LL read(){
	LL s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

int main(){
	n = read(), m = read();
	for (int i = 1; i <= n; ++i) k[i] = read();
	for (int i = 1; i <= n; ++i) c[i] = read(), s += c[i] * k[i];
	dp[0] = 1;
	for (int i = 1; i <= n; ++i)
		for (int l = s; l >= c[i]; --l)
			for (int j = 1; j <= k[i] && j * c[i] <= l; ++j)
				dp[l] = max(1LL * dp[l - j * c[i]] * j, dp[l]);
	for (int i = 1; i <= s; ++i)
		if (dp[i] >= m){
			printf("%d\n", i);
			break;
		}
	return 0;
}