Cod sursa(job #2704943)
Utilizator | Data | 11 februarie 2021 17:36:06 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n, g, w, p;
int a[10010];
int main(int argc, char const *argv[])
{
fin >> n >> g;
for (int i=1; i<=n; i++){
fin >> w >> p;
for (int j=g; j>=w; j--)
a[j] = max (a[j], a[j-w] + p);
}
fout << a[g];
return 0;
}