Pagini recente » Diferente pentru problema/arboras intre reviziile 3 si 27 | Cod sursa (job #2218867) | Cod sursa (job #1683911) | Cod sursa (job #2781766) | Cod sursa (job #2121720)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n,G,dp[10001][10001],e[10001],c[10001],i,j;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
{
f>>e[i]>>c[i];
}
for(i=1;i<=G;i++)
dp[0][i]=1000000;
for(i=1;i<=n;i++)
{
for(j=1;j<=G;j++)
{
dp[i][j]=1000000;
if(e[i]<=j)
{
dp[i][j]=min(dp[i-1][j],dp[i-1][j-e[i]]+c[i]);
}
else
dp[i][j]=min(dp[i-1][j],c[j]);
}
}
g<<dp[n][G];
return 0;
}