mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-24 05:08:47 +00:00
P1060 开心的金明
R40518321
This commit is contained in:
parent
4df21c738a
commit
19ff441b6e
25
problem/P1060/P1060.cpp
Normal file
25
problem/P1060/P1060.cpp
Normal file
@ -0,0 +1,25 @@
|
|||||||
|
#include <bits/stdc++.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int n, m, v[30005], w[30005], f[30][30005];
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
cin >> n >> m;
|
||||||
|
for (int i = 1; i <= m; i++) {
|
||||||
|
cin >> v[i] >> w[i];
|
||||||
|
w[i] *= v[i];
|
||||||
|
}
|
||||||
|
for (int i = 1; i <= m; i++) {
|
||||||
|
for (int j = 0; j <= n; j++) {
|
||||||
|
if (j >= v[i]) {
|
||||||
|
f[i][j] = max(f[i - 1][j], f[i - 1][j - v[i]] + w[i]);
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
f[i][j] = f[i - 1][j];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
cout << f[m][n] << endl;
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user