Cod sursa(job #3244393)
Utilizator | Data | 24 septembrie 2024 17:48:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int dp[10001]={};
int w[5001], p[5001];
int n,gmax;
fin>>n>>gmax;
for(int i=1;i<=n;i++)
fin>>w[i]>>p[i];
for(int i=1;i<=n;i++)
{
for(int g=gmax;g>=w[i];g--)
dp[g]=max(dp[g-w[i]]+p[i],dp[g]);
}
fout<<dp[gmax];
return 0;
}