Cod sursa(job #2201804)
Utilizator | Data | 6 mai 2018 10:48:32 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream h("rucsac.out");
int i,j,G,g,p,n,v[10001],maxi;
int main()
{ f>>n>>G;
for(i=1;i<=G;i++)
v[i]=-1;
for(i=1;i<=n;i++){
f>>g>>p;
for(j=G-g;j>=0;j--)
if(v[j]!=-1)
if(v[j+g]<v[j]+p)
v[j+g]=v[j]+p;
}
for(i=1;i<=G;i++)
if(maxi<v[i])
maxi=v[i];
h<<maxi;
return 0;
}