Pagini recente » Cod sursa (job #3177553) | Cod sursa (job #2005935) | Cod sursa (job #1202368) | Cod sursa (job #3141584) | Cod sursa (job #1428468)
#include <stdio.h>
#include <algorithm>
const int WMAX=5001;
const int INF=1e9;
int d[WMAX];
int main()
{
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
int n,g,w,i,e,c,last,j;
scanf("%d%d",&g,&w);
for(i=1; i<=w; i++)
d[i]=INF;
last=0;
for(i=1; i<=g; i++)
{
scanf("%d%d",&e,&c);
for(j=last; j>=0; j--)
if(d[j]!=INF)
if(j+e<=w)
{
if(d[j+e]>d[j]+c)
{d[j+e]=d[j]+c;
if(j+e>last)
last=j+e;
}
}
else if(d[w]>d[j]+e)
{
d[w]=d[j]+e;
last=w;
}
}
if(d[w]==INF)
printf("-1");
else
printf("%d",d[w]);
return 0;
}