Cod sursa(job #2306363)
Utilizator | Data | 22 decembrie 2018 10:22:20 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,w,p,d[10001];
int main()
{ in>>n>>g;
for(int i=1;i<=n;i++)
{ in>>w>>p;
for(int j=g;j>=w;j--)
d[j]=max(d[j-w]+p,d[j]);
}
out<<d[g];
in.close();
out.close();
return 0;
}