Pagini recente » Cod sursa (job #1896869) | Cod sursa (job #3194979) | Cod sursa (job #406942) | Cod sursa (job #779464) | Cod sursa (job #653845)
Cod sursa(job #653845)
#include<stdio.h>
int energii[1001],costuri[1001],dp[1001][20001];
int main()
{
int k,j,i,N,W,min=20000;
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
scanf("%d",&N);
scanf("%d",&W);
for(i=1;i<=N;i++)
{
scanf("%d",&energii[i]);
scanf("%d",&costuri[i]);
}
dp[1][energii[1]]=costuri[1];
for(i=2;i<=N;i++)
for(j=1;j<=10000;j++)
if(dp[i-1][j]!=0)
{
if(dp[i][j]!=0&&dp[i][j]>dp[i-1][j])
dp[i][j]=dp[i-1][j];
else
if(dp[i][j]==0)
dp[i][j]=dp[i-1][j];
if(j<W)
if(dp[i][j+energii[i]]>(dp[i-1][j]+costuri[i])&&dp[i][j+energii[i]]!=0)
dp[i][j+energii[i]]=dp[i-1][j]+costuri[i];
else
if(dp[i][j+energii[i]]==0)
dp[i][j+energii[i]]=dp[i-1][j]+costuri[i];
}
for(j=W;j<=10000;j++)
if(dp[N][j]!=0)
if(dp[N][j]<min)
min=dp[N][j];
printf("%d",min);
return 0;
}