Cod sursa(job #3355185)
| Utilizator | Data | 21 mai 2026 23:33:38 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <vector>
#include <algorithm>
// #include <fstream>
// ifstream fin("rucsac.in");
// ofstream fout("rucsac.out");
using namespace std;
int main() {
int N, G;
cin >> N >> G;
vector<int> dp(G+1, 0);
for(int i = 1; i<=N; i++) {
int W, P;
cin >> W >> P;
for(int g = G; g >= W; g--) {
dp[g] = max(dp[g], dp[g - W] + P);
}
}
cout << dp[G];
return 0;
}