Pagini recente » Cod sursa (job #382) | Cod sursa (job #2475072) | Cod sursa (job #717596) | Cod sursa (job #1884344) | Cod sursa (job #1147302)
#include<cstdio>
#include<algorithm>
#define M 2000000000
using namespace std;
FILE *f=fopen("energii.in","r");
FILE *g=fopen("energii.out","w");
int a[5002],b[5002],C[1001],En[1001],W,G;
void copie()
{
for(int i=1;i<=W;i++)
a[i]=b[i];
}
void solve()
{
int i,j;
for(i=1;i<=G;i++)
{
for(j=1;j<=W;j++)
if(j<=En[i])
b[j]=min(a[j],C[i]);
else
b[j]=min(a[j],a[j-En[i]]+C[i]);
copie();
}
fprintf(g,"%d",b[W]);
}
int main()
{
int i;
fscanf(f,"%d%d",&G,&W);
for(i=1;i<=W;i++)
a[i]=b[i]=M;
for(i=1;i<=G;i++)
fscanf(f,"%d%d",&En[i],&C[i]);
solve();
return 0;
}