2021robocom 复赛 7-2 (01背包)
Solution
比赛时直接排序乱搞过了。。dp问题做的太少,完全没发现是道 01背包 。。
(什么是傻人有傻福啊)
代码
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef double dd;
const int MAXN = 1010;
int n, m;
pair<int, int> a[MAXN];
int dp[30010];
int main()
{
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
cin >> n >> m;
int sum = 0;
for (int i = 1; i <= n;i++)
cin >> a[i].first;
for (int i = 1; i <= n;i++)
cin >> a[i].second, sum += a[i].second;
for (int i = 1; i <= n;i++)
{
for (int j = sum; j >= a[i].second;j--)
{
dp[j] = min(dp[j], dp[j - a[i].second] + a[i].first);
}
}
for (int i = sum; i >= 0;i--)
{
if(dp[i] <= m)
{
printf("%d\n", i);
return 0;
}
}
}