Pagini recente » Cod sursa (job #1565616) | Cod sursa (job #221737) | Cod sursa (job #3225348) | Cod sursa (job #3181108) | Cod sursa (job #1667091)
#include <cstdio>
using namespace std;
int v[20005], c[20005], cost[20005];
int rucsac(int n, int s){
int max = 0, i, j, min = 5000;
for (i = 1; i <= 5005; i ++)
cost[i] = 50000;
for (i = 1; i <= n; i ++){
for (j = max; j >= 0; j --){
if (cost[j] + c[i] < cost[j + v[i]])
cost[j + v[i]] = cost[j] + c[i];
if (max < j + v[i] && j + v[i] < s)
max = j + v[i];
else if (j + v[i] >= s && cost[j + v[i]] < min)
min = cost[j + v[i]];
}
}
return min;
}
int main(){
freopen("energii.in", "r", stdin);
freopen("energii.out", "w", stdout);
int n, s, i;
scanf("%d%d", &n, &s);
for (i = 1; i <= n; i ++)
scanf("%d%d", &v[i], &c[i]);
printf("%d\n", rucsac(n, s));
return 0;
}