Cod sursa(job #1313543)
Utilizator | Data | 10 ianuarie 2015 19:55:40 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
int d[10001];
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main()
{
int n,g,m=0;
in>>n>>g;
for(int i=1;i<=n;i++)
{
int x,y;
in>>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];
}
out<<m;
return 0;
}