Cod sursa(job #3215712)
Utilizator | Taerel Radu Nicolae T1radu | Data | 15 martie 2024 12:04:45 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w[5001],p[5001],dp[10001];
int main()
{
fin >> n >> g;
for(int i=1;i<=n;i++)
{
fin >> w[i] >> p[i];
}
for(int i=1;i<=n;i++)
{
for(int j=g-w[i];j>=0;j--)
{
dp[j+w[i]]=max(dp[j+w[i]],dp[j]+p[i]);
}
}
int maxp=0;
for(int i=1;i<=g;i++) maxp=max(maxp,dp[i]);
fout << maxp;
return 0;
}