Cod sursa(job #1516674)
Utilizator | Data | 3 noiembrie 2015 13:01:51 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int b[10001];
int main()
{
int i,j,m,n,gr,gr1,v;
f>>n>>gr;
for(i=1;i<=n;i++)
{
f>>gr1>>v;
for(j=gr;j>=1;j--)
if(j>=gr1)
if(b[j]<b[j-gr1]+v) b[j]=b[j-gr1]+v;
}
g<<b[gr];
f.close();
g.close();
return 0;
}