Cod sursa(job #2173478)
Utilizator | Data | 15 martie 2018 22:25:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int N,G,i,j,Greutate,Profit,A[10005];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>N>>G;
for(i=1;i<=N;++i)
{
fin>>Greutate>>Profit;
for(j=G;j>=Greutate;--j)
A[j]=max(A[j],A[j-Greutate]+Profit);
}
fout<<A[G];
fin.close ();
fout.close();
return 0;
}