Cod sursa(job #1473935)
Utilizator | Data | 20 august 2015 15:24:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
// (・⊝・)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int w[6000],p[6000];
int g[20000];
int n;
int main()
{ int i,j,G;
in>>n;
in>>G;
for(i=1;i<=n;i++)
in>>w[i]>>p[i];
for(i=1;i<=n;i++)
for(j=G-w[i];j>=0;j--)
g[j+w[i]]=max(g[j+w[i]],g[j]+p[i]);
out<<g[G];
return 0;
}