Cod sursa(job #1712781)
Utilizator | Data | 3 iunie 2016 17:57:55 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,w,p,i,val[10001],used[10001],sol;
int main()
{
f>>n>>G;
used[0]=1;
for(;n;n--)
{
f>>w>>p;
for(i=G;i-w>=0;i--)
if(used[i-w])
{
used[i]=1;
val[i]=max(val[i],val[i-w]+p);
}
}
for(i=G;i>=1;i--)
sol=max(sol,val[i]);
g<<sol<<"\n";
return 0;
}