You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
const int N = 1010;
|
|
|
|
|
|
|
|
|
|
|
|
int n, m;
|
|
|
|
|
|
int v[N], w[N];
|
|
|
|
|
|
int f[N];
|
|
|
|
|
|
string s[N];
|
|
|
|
|
|
|
|
|
|
|
|
// 如果扩展问题：取得最大值时，选择的是哪些物品？
|
|
|
|
|
|
// D:\python\TangDou\LanQiao12ShengSai\BC4.jpg
|
|
|
|
|
|
int main() {
|
|
|
|
|
|
// 物品个数n
|
|
|
|
|
|
cin >> n >> m; // m:背包容积，就是大V
|
|
|
|
|
|
for (int i = 1; i <= n; i++) cin >> w[i] >> v[i];
|
|
|
|
|
|
|
|
|
|
|
|
for (int i = 1; i <= n; i++)
|
|
|
|
|
|
for (int j = m; j >= w[i]; j--) {
|
|
|
|
|
|
if (f[j - w[i]] + v[i] > f[j]) {
|
|
|
|
|
|
f[j] = f[j - w[i]] + v[i];
|
|
|
|
|
|
s[j] = s[j - w[i]] + " " + (char)(i + '0');
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
cout << f[m] << endl;
|
|
|
|
|
|
cout << s[m] << endl;
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
