AcWing 426. 开心的金明(01背包dfs)
原题链接
简单
C++ 代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 3e4 + 10;
int n, m, res;
int g[N][3];
void dfs(const int& idx, const int& cur, const int& money)
{
if (money < 0) return;
res = max(res, cur);
if (idx == m) return;
dfs(idx + 1, cur, money);
dfs(idx + 1, cur + g[idx][2], money - g[idx][0]);
}
int main()
{
cin >> n >> m;
for (int i = 0; i < m; ++ i)
{
cin >> g[i][0] >> g[i][1];
g[i][2] = g[i][0] * g[i][1];
}
dfs(0, 0, n);
cout << res;
return 0;
}