Cod sursa(job #3234540)
Utilizator | Data | 9 iunie 2024 18:39:56 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream F("rucsac.in");
ofstream G("rucsac.out");
int main(){
int n,g;
F>>n>>g;
int weight, value;
int dp[10001] = {0};
while(F>>weight>>value) {
for(int i=g;i>=weight;i--){
dp[i]=max(dp[i],value+dp[i-weight]);
}
}
G<<dp[g]<<"\n";
// Inchidem fisierele
F.close();
G.close();
return 0;
}