P1417 烹调方案(01背包)

P1417 烹调方案https://www.luogu.com.cn/problem/P1417

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


int T, n;
struct node {
	ll a, b, c;
};
node s[MAXN];

bool cmp(node x, node y) {
	return x.c * y.b < y.c * x.b;
}

ll f[MAXN];

int main() {
	memset(f, 255, sizeof(f));
	scanf("%d %d", &T, &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", &s[i].a);
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &s[i].b);
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &s[i].c);
	}
	f[0] = 0;
	ll ans = 0;
	sort(s + 1, s + n + 1, cmp);
	for (int i = 1; i <= n; i++) {
		for (int j = T; j >= s[i].c; j--) {
			f[j] = max(f[j], f[j - s[i].c] + s[i].a - j * s[i].b);
		}
	}
	for (int i = 0; i <= T; i++) {
		ans = max(ans, f[i]);
	}
	printf("%lld", ans);
	return 0;
}