Cod sursa(job #2298553)
Utilizator | Data | 8 decembrie 2018 11:22:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,contor;
int rucsac[10001],cost[5001],profit[5001];
int main()
{
in>>n>>g;
for(int i=1;i<=n;++i)
in>>cost[i]>>profit[i];
for(int i=1;i<=n;++i)
{
for(int j=g;j>=cost[i];--j)
rucsac[j]=max(rucsac[j-cost[i]]+profit[i],rucsac[j]);
}
out<<rucsac[g];
return 0;
}