'commit'
This commit is contained in:
25
TangDou/LanQiaoBei/LanQiao12ShengSai/BC4_ErWei_DP.cpp
Normal file
25
TangDou/LanQiaoBei/LanQiao12ShengSai/BC4_ErWei_DP.cpp
Normal file
@@ -0,0 +1,25 @@
|
||||
#include <bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
const int N = 1010;
|
||||
|
||||
int n, m;
|
||||
int w[N]; //占用的时间
|
||||
int v[N]; //销售的价格
|
||||
int f[N][N];
|
||||
|
||||
int main() {
|
||||
//物品个数n
|
||||
cin >> n >> m;
|
||||
//读入重量和价值
|
||||
for (int i = 1; i <= n; i++) cin >> w[i] >> v[i];
|
||||
|
||||
for (int i = 1; i <= n; i++)
|
||||
for (int j = 1; j <= m; j++)
|
||||
if (j >= w[i]) f[i][j] = max(f[i - 1][j], f[i - 1][j - w[i]] + v[i]); //两种情况取最大值
|
||||
else f[i][j] = f[i - 1][j];
|
||||
|
||||
cout << f[n][m] << endl;
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user