Cod sursa(job #2552750)
| Utilizator | Data | 21 februarie 2020 10:23:15 | |
|---|---|---|---|
| Problema | Energii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int G, W, CG[100], EG[100], DP[100], sol;
int main()
{
fin>>G>>W;
for(int i=1;i<=G;i++) fin>>EG[i]>>CG[i];
DP[0]=0;
for(int i=1;i<=G;i++)
for(int j=W-CG[i];j>=0;j--)
{
if(DP[j+CG[i]]<DP[j]+CG[i])
DP[j+CG[i]]=DP[j]+CG[j];
sol=max(sol,DP[j+CG[i]]);
}
fout<<sol;
return 0;
}
