Cod sursa(job #3351064)
| Utilizator | Data | 16 aprilie 2026 14:47:07 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[10001];
int main()
{
int n,g_max;
cin>>n>>g_max;
for(int i=1,w,p;i<=n;i++)
{
cin>>w>>p;
for(int j=g_max;j>=w;j--)
dp[j]=max(dp[j],dp[j-w]+p);
}
cout<<dp[g_max];
}
