Pagini recente » Cod sursa (job #1334732) | Cod sursa (job #1331796) | Cod sursa (job #2839285) | Cod sursa (job #2726247) | Cod sursa (job #2000799)
#include<cstdio>
using namespace std;
int d[100005];
int main()
{
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
int n,G,g,p,i,last,j,max1=0,min1=1000000;
d[0]=0;
scanf("%d%d",&n,&G);
for(i=1;i<=G+10000;i++)
d[i]=100000;
last=0;
for(i=1;i<=n;i++)
{
scanf("%d%d",&g,&p);
for(j=last;j>=0;j--)
{
if(d[j]!=100000)
{
if(d[j]+p<d[j+g])
{
d[j+g]=d[j]+p;
if(j+g>last) last=j+g;
if(j+g>max1) max1=j+g;
}
}
}
}
for(i=max1;i>=0;i--)
if(d[i]<min1&&i>=G) min1=d[i];
if(min1!=1000000) printf("%d",min1);
else printf("-1");
return 0;
}