27 lines
699 B
C++
27 lines
699 B
C++
#include <bits/stdc++.h>
|
||
|
||
using namespace std;
|
||
const int N = 110;
|
||
const int INF = 0x3f3f3f3f;
|
||
|
||
int n, m;
|
||
int f[N][N];
|
||
|
||
int main() {
|
||
//文件输入
|
||
freopen("QiaHao_01_Min.in", "r", stdin);
|
||
scanf("%d %d", &n, &m);
|
||
memset(f, 0x3f, sizeof f); //预求最小，先设最大
|
||
f[0][0] = 0; //前0个物品中选择，装满0个空间，获得的最小值为0
|
||
|
||
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] = f[i - 1][j];
|
||
if (j >= v) f[i][j] = min(f[i][j], f[i - 1][j - v] + w);
|
||
}
|
||
}
|
||
printf("%d\n", f[n][m]);
|
||
return 0;
|
||
} |