Cod sursa(job #2772321)
| Utilizator | Data | 31 august 2021 18:44:57 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n, g, p, gr, greutate[10001], pret[10001], maxi;
int main()
{
fin>>n>>g;
greutate[0]=1;
for(int i=1; i<=n; i++)
{
fin>>gr>>p;
for(int j=g-gr; j>=0; j--)
{
if(greutate[j]==1)
{
greutate[j+gr]=1;
pret[j+gr]=max(pret[j+gr], pret[j]+p);
maxi=max(maxi, pret[j+gr]);
}
}
}
return 0;
}
