Cod sursa(job #2095926)
| Utilizator | Data | 28 decembrie 2017 13:25:13 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
#define maxn 5001
#define maxg 10001
using namespace std;
int n, sol, i, g, W[maxn], P[maxn], v[maxg];
int main() {
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
scanf("%d %d", &n, &g);
for(i=1; i<=n; i++)
scanf("%d %d", &W[i], &P[i]);
v[0] = 0;
for(i=1; i<=n; i++)
for(j=g - W[i]; j>=0; j--)
{
if( v[j+W[i]] < v[j] + P[i] )
{
v[j+W[i]] = v[j] + P[i];
if( v[j+W[i]] > sol)
sol = v[j+W[i]];
}
}
printf("%d", sol);
return 0;
}
