Pagini recente » Cod sursa (job #2201224) | Cod sursa (job #1771089) | Cod sursa (job #1289005) | Diferente pentru info-oltenia-2018/individual intre reviziile 2 si 3 | Cod sursa (job #491440)
Cod sursa(job #491440)
#include <stdio.h>
#include <assert.h>
#define Emax 10000000
#define INF 2000000000
#define Gmax 1000
int G, W, cost[Emax+1], mark[Emax+1], req[Gmax+1], gain[Gmax+1];
void read()
{
int i;
for(i=1;i<=Emax;i++)
cost[i]=INF;
freopen("energii.in","r",stdin);
scanf("%d\n%d\n",&G,&W);
for(i=1;i<=G;i++)
scanf("%d %d",&gain[i],&req[i]);
fclose(stdin);
}
void solve()
{
int i, j;
for(i=1;i<=G;i++)
{
for(j=1;j<=Emax;j++)
if(gain[i]<=j && cost[ j-gain[i] ]+req[i]<cost[j] && !mark[j-gain[i]])
cost[j]=cost[ j-gain[i] ]+req[i], mark[j]=1;
for(j=1;j<=Emax;j++)
mark[j]=0;
}
}
void write()
{
int i, min;
freopen("energii.out","w",stdout);
min=cost[W];
for(i=W+1;i<=Emax;i++)
if(cost[i]<min)
min=cost[i];
if(min==INF)
printf("-1\n");
else
printf("%d\n",min), assert(min>1 && min<10001);
fclose(stdout);
}
int main()
{
read();
solve();
write();
return 0;
}