Cod sursa(job #2090034)
Utilizator | Data | 17 decembrie 2017 15:18:23 | |
---|---|---|---|
Problema | Energii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int n,g,i,j,wi,gi,d[2][10005],ok;
int main()
{
ifstream fin("energii.in");
ofstream fout("energii.out");
fin>>n>>g;
ok=0;
for(i=1;i<=n;i++,ok=1-ok)
{fin>>wi>>gi;
for(j=0;j<=g;j++)
{
d[1-ok][j]=d[ok][j];
if(wi<=j)
d[1-ok][j]=max(d[1-ok][j],d[ok][j-wi]+gi);
}
}
fout<<d[ok][g];
return 0;
}