Cod sursa(job #3367914)
| Utilizator | Data | 12 octombrie 2026 10:05:46 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
int optim[10001], v[5002], w[5002];
signed main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g, ras=0;
cin >> n >> g;
for(int i = 1; i <= n; i++) {
cin>>v[i]>>w[i];
}
optim[0] = 0;
for (int i = 1; i <= n; i++) {
for (int j=g-v[i]; j>=0; j--) {
if (optim[j+v[i]] < optim[j] + w[i]) {
optim[j+v[i]]=optim[j]+w[i];
if (optim[j+v[i]] > ras) {
ras = optim[j+v[i]];
}
}
}
}
cout<<ras;
return 0;
}