Cod sursa(job #2493203)
| Utilizator | Data | 16 noiembrie 2019 09:45:51 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, g, dp[10005];
int w[5005], p[5005];
void dinamica(){
for (int i = 0; i < n; ++i) {
for(int wi = g ; wi >= w[i]; --wi){
dp[wi] = max(dp[wi - w[i]] + p[i], dp[wi]);
}
}
}
int main() {
ifstream f("rucsac.in");
ofstream o("rucsac.out");
f>>n>>g;
for (int i = 0; i < n; ++i) {
f>>w[i]>>p[i];
}
dinamica();
o<<dp[g];
return 0;
}