Cod sursa(job #1089650)
Utilizator | Data | 21 ianuarie 2014 20:31:07 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream gg("rucsac.out");
int optim[10001];
int n,i,j,G,g,p,sol;
int main()
{
f>>n>>G;
for(;n;--n)
{
f>>g>>p;
for(j=G-g;j>=0;--j)
if(optim[j+g]<optim[j]+p)
{
optim[j+g]=optim[j]+p;
sol=max(sol,optim[j+g]);
}
}
gg<<sol;
return 0;
}