Pagini recente » Cod sursa (job #2613537) | Cod sursa (job #2464113) | Cod sursa (job #47335) | Cod sursa (job #2843187) | Cod sursa (job #1865211)
#include <bits/stdc++.h>
using namespace std;
int n, W, ans;
int e[1005], c[1005];
int dp[1005][5005];
int main() {
ifstream cin("energii.in");
ofstream cout("energii.out");
cin >> n >> W;
for (int i = 1; i <= n; i++) cin >> e[i] >> c[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= W; j++)
dp[i][j] = 100000;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= W; j++) {
if (j > e[i]) dp[i][j] = min(dp[i-1][j], dp[i-1][j-e[i]] + c[i]);
else dp[i][j] = min(dp[i-1][j], c[i]);
}
}
cout << ((dp[n][W] == 100000) ? -1 : dp[n][W]);
}