Pagini recente » Cod sursa (job #824349) | Cod sursa (job #1451338) | Istoria paginii runda/oji200911/clasament | Monitorul de evaluare | Cod sursa (job #1449779)
#include<cstdio>
struct generator{int e, c;};
generator v[1001];
int cost[15001];
int main(){
int i,n,w,g,j,max;
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
scanf("%d%d",&g,&w);
max=0;
for(i=1;i<=g;i++){
scanf("%d %d",&v[i].e,&v[i].c);
if(v[i].e>max)
max=v[i].e;
}
n=w+max;
for(i=1;i<=g;i++){
for(j=n;j>=1;j--)
if(cost[j]!=0)
if(j+v[i].e<=n)
if(cost[j]+v[i].c<cost[j+v[i].e])
cost[j+v[i].e]=cost[j]+v[i].c;
if(cost[v[i].e]>v[i].c&&v[i].e!=0||cost[v[i].e]==0)
cost[v[i].e]=v[i].c;
}
i=w;
while(cost[i]==0&&i<=n)
i++;
printf("%d",cost[i]);
return 0;
}