Pagini recente » Cod sursa (job #2638955) | Cod sursa (job #213229) | Cod sursa (job #2637451) | Cod sursa (job #2093942) | Cod sursa (job #1429289)
#include <cstdio>
using namespace std;
int d[10000002];
int main()
{
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
int n, gmax, g, p, i, j, dr, pmin,ok=0;
scanf("%d%d", &n, &gmax);
dr=0;
pmin=10000002;
for(i=1; i<=n; i++)
{
scanf("%d%d", &g, &p);
for(j=dr; j>=0; j--)
{
if (d[j]!=0 || j==0)
{
if(d[j+g]==0)
d[j+g]=p+d[j];
else
if (d[j+g]>d[j]+p)
{
d[j+g]=d[j]+p;
}
if(d[j+g]<pmin && j+g>=gmax)
pmin=d[j+g];
if(j+g<gmax && j+g>dr)
dr=j+g;
}
}
}
if(pmin==10000002)
pmin=-1;
printf("%d\n", pmin);
return 0;
}