Cod sursa(job #1735956)
Utilizator | patcas rares danut patcasrares | Data | 31 iulie 2016 18:13:46 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<algorithm>
#define INF 1000000000
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int N,G,g,v,i,j,maxim,W[10001];
int main()
{
fi>>N>>G;
for(i=1; i<=G; i++)
W[i]=-INF;
for(i=1; i<=N; i++)
{
fi>>g>>v;
for(j=G-g; j>=0; j--)
if(W[j]!=-INF)
W[j+g]=max(W[j+g],W[j]+v);
}
for(i=0; i<=G; i++)
if(W[i]>maxim)
maxim=W[i];
fo<<maxim<<"\n";
fi.close();
fo.close();
return 0;
}