Pagini recente » Cod sursa (job #1651783) | Cod sursa (job #2320926) | Cod sursa (job #1087216) | Cod sursa (job #2668438) | Cod sursa (job #2309858)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int n, G;
int w[1001], p[1001], sol[5010];
int main()
{
fin>>n>>G;
for(int i=1; i<=n; ++i)
{
//sol[i]=INT_MAX;
fin>>w[i]>>p[i];
}
for(int i=1; i<=G; ++i) sol[i]=100010;
//for(int i=1; i<=n; ++i) sol[w[i]]=p[i];
sol[0]=0;
for(int i=1; i<=n; ++i)
{
for(int j=G; j>=w[i]; --j)
{
if(sol[j-w[i]]+p[i]<sol[j])
{
sol[j]=sol[j-w[i]]+p[i];
}
}
for(int j=1; j<=w[i]; ++j) if(sol[j]>p[i]) sol[j]=p[i];
}
if(sol[G]==100010) fout<<"-1\n";
else fout<<sol[G]<<"\n";
return 0;
}