Pagini recente » Cod sursa (job #2839537) | Cod sursa (job #1592858) | Cod sursa (job #2894078) | Cod sursa (job #1889585) | Cod sursa (job #1865232)
#include <bits/stdc++.h>
using namespace std;
int n, W, ans;
int e[1005], c[1005];
int dp[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 j = 0; j <= W; j++) dp[j] = 100000;
for (int i = 1; i <= n; i++) {
for (int j = W; j >= 1; j--) {
if (j > e[i]) dp[j] = min(dp[j], dp[j-e[i]] + c[i]);
else dp[j] = min(dp[j], c[i]);
}
}
cout << ((dp[W] == 100000) ? -1 : dp[W]);
}