Cod sursa(job #1021141)
| Utilizator | Data | 3 noiembrie 2013 12:34:13 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <cstdio>
using namespace std;
int N,G,Gr[5005],P[5005];
int S;
int Rucsac[10005];
void Citire()
{
scanf("%d %d",&N,&G);
for(int i=0;i<N;++i)
scanf("%d %d",&Gr[i],&P[i]);
}
void Rezolvare()
{
for(int i=0;i<N;++i)
for(int j=G-Gr[i];j>=0;--j)
if(Rucsac[j+Gr[i]]<Rucsac[j]+ P[i])
{
Rucsac[j+Gr[i]]=Rucsac[j]+P[i];
if(Rucsac[j+Gr[i]]>S)
S=Rucsac[j+Gr[i]];
}
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
Citire();
Rezolvare();
printf("%d",S);
return 0;
}
