结果编译错误
by _JEB_ @ 2020-02-23 20:42:23
我想知道该怎么弄
by _JEB_ @ 2020-02-23 20:42:31
@[Flandre_495](/user/102726)
by _JEB_ @ 2020-02-23 20:42:46
能发一下全部代码吗
by _JEB_ @ 2020-02-23 20:42:59
@[wjh_](/user/194991)
@[Flandre_495](/user/102726)
by _JEB_ @ 2020-02-23 20:44:25
@[Charlie___j](/user/133151) 发什么代码？
如果是想看正解题解里有啊~
by Flandre_495 @ 2020-02-23 20:47:39
还有这题不用double啊
by Flandre_495 @ 2020-02-23 20:48:36
@[Charlie___j](/user/133151) $v$判定条件应该是$v>=0$
by Skyjoy @ 2020-02-23 20:52:34
**~~此题不是01背包板子吗？~~**
```cpp
//by XTH号游侠
#include <bits/stdc++.h>
using namespace std;
int n,v;
int c[110],w[110];
int f[110][1010];
int main () {
cin >> v >> n;
for (int i = 1; i <= n; i++) cin >> c[i] >> w[i];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= v; j++) {
if (j >= c[i]) f[i][j] = max (f[i - 1][j - c[i]] + w[i],f[i - 1][j]);
else f[i][j] = f[i - 1][j];
}
}
cout << f[n][v] << endl;
return 0;
}
```
**↑My code**
by __LePetitPrince__ @ 2020-02-23 21:38:41
@[Charlie___j](/user/133151) 窝没有降维（**一点建议~~如果你像我一样是个蒟蒻~~：先写不降维代码，再改成降维**）
by __LePetitPrince__ @ 2020-02-23 21:41:12