Cod sursa(job #1618916)
Utilizator | Data | 28 februarie 2016 09:20:01 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,m,i,a[10005],j,g,c,ma;
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
a[i]=-1;
for(i=1;i<=n;i++)
{
fin>>g>>c;
for(j=m-g;j>=0;j--)
if(a[j]>-1)
if(a[j+g]<a[j]+c)
{
a[j+g]=a[j]+c;
if(a[j+g]>ma)
ma=a[j+g];
}
}
fout<<ma;
return 0;
}