Cod sursa(job #1455536)
Utilizator | Data | 28 iunie 2015 12:45:14 | |
---|---|---|---|
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");
int n,G,i,j,sol;
int a[5001],p[5001],b[10002];
int main()
{
f>>n>>G;
for(i=1;i<=n;++i) f>>a[i]>>p[i];
for(i=1;i<=n;++i)
for(j=G-a[i];j>=0;--j)
if(b[j+a[i]]<b[j]+p[i])
{
b[j+a[i]]=b[j]+p[i];
sol=max(sol,b[j+a[i]]);
}
g<<sol;
g.close();
return 0;
}