Pagini recente » Cod sursa (job #2785395) | Cod sursa (job #628033) | Cod sursa (job #1311861) | Cod sursa (job #1570387) | Cod sursa (job #2449919)
#include <bits/stdc++.h>
#define INF INT_MAX
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n, v[1005], pd[5005], w[1005], G,maxim;
int main()
{
f >> n >> G;
for(int i = 1; i <= n; ++i)
{
f >> v[i] >> w[i];
maxim += v[i];
}
for(int i = 1; i <= G; ++i)
pd[i] = INF;
for(int i = 1; i <= n; ++i)
for(int j = maxim - v[i]; j >= 0; --j)
if(pd[j] != INF)
pd[j + v[i]] = min(pd[j + v[i]], pd[j] + w[i]);
for(int i = G; i <= maxim; ++i)
{
if(pd[i] != INF)
{
g << pd[i] ;
f.close();
g.close();
return 0;
}
}
g << -1;
f.close();
g.close();
return 0;
}