Pagini recente » Cod sursa (job #1479675) | Cod sursa (job #849703) | Cod sursa (job #2916063) | Cod sursa (job #1856841) | Cod sursa (job #1667899)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int a[5005];
int main()
{
int G,W,EG,CG,i,j,s=0,x;
f>>G>>W;
for(i=1;i<=W;i++)
a[i]=50000000;
for(i=1;i<=G;i++)
{
f>>EG>>CG;
s+=EG;
if(s<W)
a[s]=a[s-EG]+CG;
else
{
if(EG>=W)
a[W]=min(a[W],CG);
else
for(j=W-EG;j<W;j++)
a[W]=min(a[W],a[j]+CG);
}
}
if(s<W)
g<<-1;
else
g<<a[W];
return 0;
}