Cod sursa(job #2150477)
| Utilizator | Data | 3 martie 2018 16:24:03 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int n,G,i,j,g,v,maxx,s[10010];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
fin>>n>>G;
for(i=0;i<=10000;i++)
s[i]=-1;
s[0]=0;
maxx=0;
for(i=1;i<=n;i++)
{
fin>>g>>v;
for(j=G-g;j>=0;j--)
{
if(s[j]!=-1 && s[j+g]<s[j]+v)
{
s[j+g]=s[j]+v;
if(s[j+g]>maxx) maxx=s[j+g];
}
}
}
fout<<maxx;
fin.close();
fout.close();
return 0;
}
