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 = 110;
|
|
|
|
|
|
const int INF = 0x3f3f3f3f;
|
|
|
|
|
|
/*
|
|
|
|
|
|
个数 空间至少5
|
|
|
|
|
|
体积 价值
|
|
|
|
|
|
|
|
|
|
|
|
求： 最小价值
|
|
|
|
|
|
|
|
|
|
|
|
3 5
|
|
|
|
|
|
1 2
|
|
|
|
|
|
4 9
|
|
|
|
|
|
3 6
|
|
|
|
|
|
|
|
|
|
|
|
答案应该是：11。 即 1,4-->2+9=11
|
|
|
|
|
|
*/
|
|
|
|
|
|
int n, m;
|
|
|
|
|
|
int f[N][N];
|
|
|
|
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
|
|
scanf("%d %d", &n, &m);
|
|
|
|
|
|
|
|
|
|
|
|
memset(f, 0x3f, sizeof f);
|
|
|
|
|
|
f[0][0] = 0;
|
|
|
|
|
|
|
|
|
|
|
|
// 01背包！！！
|
|
|
|
|
|
for (int i = 1; i <= n; i++) {
|
|
|
|
|
|
int v, w;
|
|
|
|
|
|
scanf("%d %d", &v, &w);
|
|
|
|
|
|
for (int j = 0; j <= m; j++)
|
|
|
|
|
|
f[i][j] = min(f[i - 1][j], f[i - 1][max(0, j - v)] + w);
|
|
|
|
|
|
}
|
|
|
|
|
|
printf("%d\n", f[n][m]);
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
