Cod sursa(job #2201808)
Utilizator | Data | 6 mai 2018 10:55:13 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int v[10001],x,n,g,w,p,i,Max;
int main()
{
fin>>n>>g;
for(i=1;i<=g;i++)
v[i]=-1;
v[0]=0;
for(i=1;i<=n;i++){
fin>>w>>p;
x=g-w;
for(j=x;j>=0;j--)
if(v[j]!=-1&&v[j+x]<v[j]+p){
v[j+x]=v[j]+p;
}
}
for(i=1;i<=g;i++)
Max=max(Max,v[i]);
fout<<Max;
return 0;
}