Cod sursa(job #1088068)
Utilizator | Data | 20 ianuarie 2014 09:42:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int g[5001],p[5001],o[10001];
int main()
{
int n,i,j,s=0,gr;
fin>>n>>gr;
for(i=1;i<=n;i++)
fin>>g[i]>>p[i];
for(i=1;i<=n;i++)
for(j=gr-g[i];j>=0;j--)
if(o[j+g[i]]<o[j]+p[i])
{
o[j+g[i]]=o[j]+p[i];
if(o[j+g[i]]>s)s=o[j+g[i]];
}
fout<<s;
return 0;
}