Pagini recente » Cod sursa (job #3033038) | Borderou de evaluare (job #1026677) | Cod sursa (job #679572) | Cod sursa (job #2092905) | Cod sursa (job #2317923)
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int n, G;
int w[1001], p[1001], sol[5010];
int main()
{
in >> n >> G;
for (int i = 1; i <= n; ++i)
in >> w[i] >> p[i];
for (int i = 1; i <= G; ++i)
sol[i] = 100010;
sol[0] = 0;
for (int i = 1; i <= n; ++i)
{
for (int j = G; j >= w[i]; --j)
{
sol[j] = max(sol[j - w[i]] + p[i], p[i]);
if (sol[j - w[i]] + p[i] < sol[j])
sol[j] = sol[j - w[i]] + p[i];
}
}
if (sol[G] == 100010)
out << -1;
else
out << sol[G] << '\n';
return 0;
}