Cod sursa(job #1795612)
Utilizator | Data | 2 noiembrie 2016 18:34:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,mat[5002][10005];
pair<int,int>p[5002];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
fin>>p[i].first>>p[i].second;
for(int i=1;i<=n;i++)
for(int j=1;j<=g;j++)
{
if(j>=p[i].first)
mat[i][j]=max(max(mat[i][j-1],mat[i-1][j]),mat[i-1][j-p[i].first]+p[i].second);
else mat[i][j]=max(mat[i][j-1],mat[i-1][j]);
}
fout<<mat[n][g]<<"\n";
return 0;
}