Cod sursa(job #1323202)
Utilizator | Data | 20 ianuarie 2015 19:57:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int d[10001];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n,g,m=0;
fin>>n>>g;
for(int i=1; i<=n; i++)
{
int x,y;
fin>>x>>y;
for(int j=g; j>=0; j--)
{
if(j+x<=g && d[j+x]<d[j]+y)
d[j+x]=d[j]+y;
}
}
for(int i=1; i<=g; i++)
{
if(d[i]>m)
m=d[i];
}
fout<<m;
return 0;
}