Cod sursa(job #3343577)
| Utilizator | Data | 27 februarie 2026 19:24:21 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main(){
int n, g;
fin >> n >> g;
vector<int> w(n), p(n);
for(int i = 0; i < n; i++)
fin >> w[i] >> p[i];
vector<int> dp(g + 1, 0);
for(int i = 0; i < n; i++)
for(int j = g; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
fout << dp[g] << "\n";
}
