Cod sursa(job #879233)
Utilizator | Data | 15 februarie 2013 09:38:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,G,d[50001],sol=0;
int main()
{
int i,j,x,y;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>N>>G;
for(i=1;i<=N;i++)
{
f>>x>>y;
for(j=G-x;j>=0;j--)
{
if(d[j+x]<d[j]+y)
d[j+x]=d[j]+y;
if(d[j+x]>sol)
sol=d[j+x];
}
}
g<<sol;
return 0;
}