Cod sursa(job #2488730)
Utilizator | Data | 7 noiembrie 2019 16:02:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G;
int vect[5005];
void citire()
{
f>>n>>G;
int greut,profit;
for(int i=0;i<n;i++)
{
f>>greut>>profit;
for(int j=G;j>=greut;j--)
vect[j]=max(vect[j-greut]+profit ,vect[j]);
}
g<<vect[G];
}
int main()
{
citire();
return 0;
}