Cod sursa(job #3247775)
| Utilizator | Data | 9 octombrie 2024 09:36:45 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, G;
struct ob
{
int w, p;
};
vector <ob> v;
int dp[5001][10001];
int main()
{
cin >> n >> G;
v.resize(n+1);
for(int i=1; i<=n; i++)
cin >> v[i].w >> v[i].p;
for(int i=1; i<=n; i++)
for(int j=0; j<=G; j++)
{
dp[i][j] = dp[i-1][j];
if(j >= v[i].w && dp[i-1][j-v[i].w] + v[i].p > dp[i][j])
dp[i][j] = dp[i-1][j-v[i].w] + v[i].p;
}
cout << dp[n][G];
return 0;
}
