Pagini recente » Cod sursa (job #822062) | Cod sursa (job #2830559) | Cod sursa (job #3213404) | Cod sursa (job #2812169) | Cod sursa (job #2548649)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("energii.in");
ofstream fout("energii.out");
int n,W,k,i,j;
int D[5005],E[1005],C[1005];
int main ()
{
fin>>n;
fin>>W;
for(i=1;i<=n;i++)
{
fin>>E[i];
fin>>C[i];
}
for(i=1;i<=W;i++)
D[i]=999999999;
for(i=1;i<=n;i++)
for(j=W-1;j>=0;j--)
if(D[j]!=999999999)
{
k=min(j+E[i],W);
D[k]=min(D[k],D[j]+C[i]);
}
if(D[W]==999999999)
fout<<-1;
else
fout<<D[W];
return 0;
}