Cod sursa(job #1755982)
Utilizator | Data | 11 septembrie 2016 15:59:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w,p,optim[10001];
int main()
{
fin>>n>>g;
for(int i=1; i<=n; i++){
fin>>w>>p;
for(int j=g; j>=w; j--){
optim[j]=fmax(optim[j], optim[j-w]+p);
}
}
fout<<optim[g];
return 0;
}