Cod sursa(job #2147138)
| Utilizator | Data | 28 februarie 2018 15:09:52 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int x[10005],n,g,g1,p1;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d",&n,&g);
for (int i=1;i<=n;i++)
{
scanf("%d %d",&g1,&p1);
for (int j=g;j>=g1;j--)
if (x[j]<x[j-g1]+p1)
x[j]=x[j-g1]+p1;
}
printf("%d",x[g]);
return 0;
}
