Pagini recente » Cod sursa (job #371996) | Cod sursa (job #1397865) | Cod sursa (job #1443499) | Cod sursa (job #2141450) | Cod sursa (job #3246573)
#include <bits/stdc++.h>
using namespace std;
int dp[5005], w[1005], p[1005];
int main()
{
ifstream cin("energii.in");
ofstream cout("energii.out");
int n, G;
cin >> n >> G;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> p[i];
for (int i = 1; i <= G; ++i)
dp[i] = 10000000;
dp[0] = 0;
for (int i = 1; i <= n; ++i)
for (int j = G; j >= w[i]; --j)
if (dp[j-w[i]] != INT_MAX)
dp[j] = min(dp[j], dp[j-w[i]]+p[i]);
int ans = 10000000;
for (int i = G; i <= 5000; ++i)
if (dp[i])
ans = min(ans, dp[i]);
cout << ans;
return 0;
}