Cod sursa(job #3357549)
| Utilizator | Data | 11 iunie 2026 10:53:20 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v[5001];
int w[5001];
int dp[10001];
int n,k;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>w[i]>>v[i];
}
for(int i = 1;i<=n;i++){
for(int j = k;j>=w[i];j--){
dp[j] = max(dp[j], dp[j-w[i]]+v[i]);
}
}
int vmax = -1;
for(int i=1;i<=k;i++){
vmax = max(vmax, dp[i]);
}
fout<<vmax;
return 0;
}
