41 lines
1001 B
C++
41 lines
1001 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
const int N = 1010;
|
||
|
|
|
||
|
|
int n, m;
|
||
|
|
int w[N]; //占用的时间
|
||
|
|
int v[N]; //销售的价格
|
||
|
|
int f[N][N];//最优解
|
||
|
|
string s[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++) {
|
||
|
|
int x = f[i - 1][j - w[i]] + v[i];
|
||
|
|
int y = f[i - 1][j];
|
||
|
|
if (j >= w[i]) {
|
||
|
|
if (x > y) {
|
||
|
|
f[i][j] = x;
|
||
|
|
s[i][j] = s[i - 1][j - w[i]] + " " + char(i + '0');
|
||
|
|
} else {
|
||
|
|
f[i][j] = y;
|
||
|
|
s[i][j] = s[i - 1][j];
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
f[i][j] = y;
|
||
|
|
s[i][j] = s[i - 1][j];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
cout << f[n][m] << endl;
|
||
|
|
cout << s[n][m] << endl;
|
||
|
|
return 0;
|
||
|
|
}
|