mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-23 20:08:47 +00:00
P1048 [NOIP2005 普及组] 采药
R67361911
This commit is contained in:
parent
1b0edafd84
commit
a076967f79
@ -1,21 +1,24 @@
|
|||||||
#include <bits/stdc++.h>
|
#include <iostream>
|
||||||
|
|
||||||
using namespace std;
|
using std::cin;
|
||||||
|
using std::cout;
|
||||||
|
using std::endl;
|
||||||
|
|
||||||
|
int t, m, v[105], w[105], f[105][105];
|
||||||
|
|
||||||
int main() {
|
int main() {
|
||||||
int t, m, w[1005], v[1005], dp[1005][1005];
|
|
||||||
cin >> t >> m;
|
cin >> t >> m;
|
||||||
for (int i = 1; i <= m; i++) {
|
for (int i = 1; i <= m; i++) {
|
||||||
cin >> w[i] >> v[i];
|
cin >> v[i] >> w[i];
|
||||||
}
|
}
|
||||||
for (int i = 1; i <= m; i++) {
|
for (int i = 1; i <= m; i++) {
|
||||||
for (int j = t; j >= 0; j--) {
|
for (int j = t; j >= 0; j--) {
|
||||||
dp[i][j] = dp[i - 1][j];
|
f[i][j] = f[i - 1][j];
|
||||||
if (j >= w[i]) {
|
if (j >= v[i]) {
|
||||||
dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i]] + v[i]);
|
f[i][j] = std::max(f[i][j], f[i - 1][j - v[i]] + w[i]);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
cout << dp[m][t] << endl;
|
cout << f[m][t] << endl;
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user