Cod sursa(job #1908020)
Utilizator | Data | 6 martie 2017 22:16:05 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#define in "rucsac.in"
#define out "rucsac.out"
#define Gmax 10003
using namespace std;
ifstream fin(in);
ofstream fout(out);
int N,G;
int a[Gmax];
int W,P;
int main()
{
fin>>N>>G;
while(N--)
{
fin>>W>>P;
for(int i=G; i>0; --i)
if(W <= i)
a[i] = max(a[i],a[i-W]+P);
}
fout<<a[G]<<"\n";
fin.close(); fout.close();
return 0;
}