|
|
|
|
讨论 Discussion |
|
| |
 . |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
freopen("p1317.in", "r", stdin);
freopen("p1317.out", "w", stdout);
int N, m;
cin >> N >> m;
vector<int> v(m + 1), w(m + 1);
for (int i = 1; i <= m; i++) {
cin >> v[i] >> w[i];
}
vector<int> dp(N + 1, 0);
for (int i = 1; i <= m; i++) {
for (int j = N; j >= v[i]; j--) {
dp[j] = max(dp[j], dp[j - v[i]] + v[i] * w[i]);
}
}
cout << dp[N] << endl;
return 0;
}
( ) |
|
|
|
|
|
|
|
|
|
Flag |
|
题号 |
P1317 |
|
其它 |
通过 |
13人 |
提交 |
29次 |
通过率 |
45% |
难度 |
3 |
|
|
|
|
|
|
