Pagini recente » Cod sursa (job #2401594) | Cod sursa (job #2957749) | Cod sursa (job #2965028) | Cod sursa (job #298912) | Cod sursa (job #2031832)
#include <fstream>
using namespace std;
int n,cost,i,j;
int a[1001],b[5001],d[1001][5001];
ifstream fi("energii.in");
ofstream fo("energii.out");
int main()
{
fi>>n;
fi>>cost;
for(i=1;i<=n;i++)
fi>>a[i]>>b[i];
for(i=0;i<=n;i++)
for(j=0;j<=cost;j++)
d[i][j]=300000000;
d[0][0]=0;
for(i=1;i<=n;i++)
for(j=0;j<=cost;j++)
{
d[i][j]=d[i-1][j];
if(j-a[i]>=0)
d[i][j]=min(d[i][j],d[i-1][j-a[i]]+b[i]);
}
if(d[n][cost]==300000000)
fo<<-1;
else
fo<<d[n][cost];
return 0;
}