Cod sursa(job #770307)
Utilizator | Data | 22 iulie 2012 17:45:28 | |
---|---|---|---|
Problema | Energii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main()
{
int n, energiemin, D[100][100], i, j, en[100], cost[100];
ifstream f("energii.in");
ofstream g("energii.out");
f>>n>>energiemin;
for(i=1; i<=n; i++)
{
f>>en[i]>>cost[i];
}
int l=0;
for(i=1; i<=n;l=1-l, i++)
{
for(j=0; j<=energiemin; j++)
{
D[1-l][j]=D[l][j];
D[1-l][j]=max(D[1-l][j], D[l][j+en[i]]+cost[i]);
}
}
g<<D[l][energiemin];
}