Pagini recente » Cod sursa (job #3256281) | Cod sursa (job #846063) | Cod sursa (job #1278847) | Cod sursa (job #116760) | Cod sursa (job #3246581)
#include <bits/stdc++.h>
using namespace std;
int dp[10005], w[5005], p[5005];
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 <= 10001; ++i)
dp[i] = 10000000;
dp[0] = 0;
for (int i = 1; i <= n; ++i)
for (int j = G; j >= w[i]; --j)
dp[j] = min(dp[j], dp[j-w[i]]+p[i]);
int ans = 10000000;
for (int i = G; i <= 10001; ++i)
ans = min(ans, dp[i]);
cout << ((ans == 10000000) ? -1 : ans);
return 0;
}