Cod sursa(job #1324702)
Utilizator | Mihailescu Vlad Tiberiu VladTiberiu | Data | 22 ianuarie 2015 18:24:44 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
struct asd{
long long g,p;
}a[10050];
long long N,G,i,j;
long long d[10050];
int main()
{
f >> N >> G;
for(i = 1; i <= N; ++i){
f >> a[i].g >> a[i].p;
}
for(i = 1; i <= N; ++i){
for(j = G; j >= a[i].g; --j){
d[j] = max(d[j],d[j-a[i].g] + a[i].p);
}
}
g << d[G];
return 0;
}