Pagini recente » Cod sursa (job #578511) | Cod sursa (job #854934) | Cod sursa (job #2666991) | Cod sursa (job #2196716) | Cod sursa (job #1840902)
#include <iostream>
#include <fstream>
#define N 1011
#define W 5011
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int const oo=200000000;
int a[N][W],val[N],i,j,n,m,G,k,cost[W];
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
f>>val[i]>>cost[i];
for(i=1;i<=n;i++)
for(j=1;j<=G;j++)
a[i][j]=oo;
for(i=2;i<=n;i++)
{
for(j=1;j<=G;j++)
{
a[i][j]=a[i-1][j];
if(val[i]<G)
a[i][j]=min(a[i-1][j],a[i-1][j-val[i]]+cost[i]);
else
a[i][j]=min(a[i-1][j],cost[i]);
}
}
g<<a[n][G];
}