Cod sursa(job #2540284)
Utilizator | Data | 6 februarie 2020 22:22:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[10001], n, G;
int main() {
cin >> n >> G;
for(int i = 1; i <= n; i++) {
int g, w;
cin >> w >> g;
for(int j = G - w; j >= 0; j--)
dp[j + w] = max(dp[j + w], dp[j] + g);
}
cout << dp[G];
return 0;
}