烹调方案——洛谷1417

最新推荐文章于 2024-08-30 15:57:36 发布

华年的小年华

最新推荐文章于 2024-08-30 15:57:36 发布

阅读量77

点赞数

分类专栏： dp 文章标签：算法 c++ Powered by 金山文档

本文链接：https://blog.csdn.net/Yapink/article/details/128905751

版权

dp 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 55;

int n, m;
LL f[100010];

struct st {
    LL a, b, c;   
}x[N];

int main()
{
    cin >> m >> n;
    
    for (int i = 1; i <= n; i ++ ) cin >> x[i].a;
    for (int i = 1; i <= n; i ++ ) cin >> x[i].b;
    for (int i = 1; i <= n; i ++ ) cin >> x[i].c;
    
    sort(x + 1, x + n + 1, [&](st A, st B) {
        return A.b * B.c > B.b * A.c;
    });

    for (int i = 1; i <= n; i ++ )
        for (int j = m; j >= x[i].c; j -- )
            f[j] = max(f[j], f[j - x[i].c] + x[i].a - j * x[i].b);
    LL res = 0;
    for (int i = 1; i <= m; i ++ ) res = max(res, f[i]);
    cout << res << endl;
    return 0;
}