Cod sursa(job #2121726)
Utilizator | Data | 4 februarie 2018 11:37:59 | |
---|---|---|---|
Problema | Energii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#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]=100000000;
for(i=1;i<=n;i++)
{
for(j=1;j<=G;j++)
{
dp[i][j]=100000000;
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[i]);
}
}
if(dp[n][G]==100000000)
g<<-1;
else
g<<dp[n][G];
return 0;
}