Cod sursa(job #3311154)
| Utilizator | Data | 19 septembrie 2025 22:22:15 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <vector>
#define nmax (int)(1e4+1)
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,m,g,p,sol,dp[nmax];
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
dp[i]=-1;
for(int i=1;i<=n;i++){
cin>>g>>p;
for(int j=m-g;j>=0;j--)
if(dp[j]!=-1)
dp[j+g]=max(dp[j+g],dp[j]+p);
}
for(int i=1;i<=m;i++)
sol=max(sol,dp[i]);
cout<<sol;
return 0;
}
