Cod sursa(job #1332873)
| Utilizator | Data | 2 februarie 2015 15:34:09 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#define Nmax 5001
#define Gmax 100001
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N,G,i,j,sol;
short int W[Nmax],P[Nmax],DP[Nmax][Gmax];
void read()
{
fin>>N>>G;
for(int i=1;i<=N;++i)
fin>>W[i]>>P[i];
}
void solve()
{cout<<5;
int i,j;
for(i=1;i<=N;i++)
{
for(j=0;j<=G;j++)
DP[i][j]=max(DP[i-1][j],DP[i-1][j-W[i]]+P[i]);
}
fout<<DP[N][G];
}
int main()
{
read();
solve();
return 0;
}
