Cod sursa(job #2201803)
Utilizator | Data | 6 mai 2018 10:46:36 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream h("rucsac.out");
int i,j,G,g,p,n,v[10001];
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;
}
i=G;
while(v[i]==-1)
i--;
h<<v[i];
return 0;
}