Cod sursa(job #3003776)
| Utilizator | Data | 15 martie 2023 22:04:40 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int v[10005];
int main()
{
int n, g;
fin >> n >> g;
vector <int> w(n+5);
vector <int> p(n+5);
for(int i = 1; i <= n; i++)
fin >> w[i] >> p[i];
for(int i = 1; i <= n; i++)
{
for(int j = g; j >= w[i]; j--)
{
v[j] = max(v[j], v[j-w[i]] + p[i]);
}
}
fout << v[g];
return 0;
}
