Pagini recente » Cod sursa (job #705123) | Cod sursa (job #2770355) | Cod sursa (job #2816326) | Cod sursa (job #1469478) | Cod sursa (job #2394824)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int n,x,maxim,k,minim,i1,i,g1,g;
int d[10004];
int main()
{
fin>>n>>g1;
for(int i=1;i<=g1;i++)
d[i]=100000;
for(int i=1;i<=n;i++)
{
fin>>g>>x;
for(int j=g1;j>=0;j--)
{
if(d[j]!=100000 && g+j<=g1)
{
d[j+g]=min(d[j+g],d[j]+x);
}
if(g+j>g1)
d[g1]=min(d[g1],d[j]+x);
}
}
fout<<d[g1];
return 0;
}