Cod sursa(job #3264020)
| Utilizator | Data | 17 decembrie 2024 18:09:13 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
long long n,gt, g[5010], p[5010], dp[10001][10001], pmax;
int main()
{
fin>>n>>gt;
for(int i=1; i<=n; i++){
fin>>g[i]>>p[i];
}
for(int i=1; i<=n; i++){
for(int j=0; j<=gt; j++){
dp[i][j]=dp[i-1][j];
if(g[i]<=j)
dp[i][j]=max(dp[i][j], dp[i-1][j-g[i]]+p[i]);
}
}
pmax=dp[n][gt];
fout<<p;
return 0;
}
